A New Time-Space Lower Bound for Nondeterministic Algorithms Solving Tautologies

Simple item page
dc.contributor.authorDiehl, S.en_US
dc.contributor.authorMelkebeek, D. vanen_US
dc.contributor.authorWilliams, R.en_US
dc.date.accessioned2012-03-15T17:30:01Z
dc.date.available2012-03-15T17:30:01Z
dc.date.created2007en_US
dc.date.issued2007
dc.description.abstractWe show that for all realsen_US
dc.format.mimetypeapplication/pdfen_US
dc.identifier.citationTR1601
dc.identifier.urihttp://digital.library.wisc.edu/1793/60768
dc.publisherUniversity of Wisconsin-Madison Department of Computer Sciencesen_US
dc.titleA New Time-Space Lower Bound for Nondeterministic Algorithms Solving Tautologiesen_US
dc.typeTechnical Reporten_US

Files

Original bundle

Now showing 1 - 1 of 1
Thumbnail Image
Name:
TR1601.pdf
Size:
198.61 KB
Format:
Adobe Portable Document Format
Download

Collections

CS Technical Reports