An improved time-space lower bound for tautologies

Scott Diehl, Dieter Melkebeek () and Ryan Williams
Additional contact information
Scott Diehl: University of Wisconsin-Madison
Dieter Melkebeek: University of Wisconsin-Madison
Ryan Williams: University of Wisconsin-Madison

Journal of Combinatorial Optimization, 2011, vol. 22, issue 3, No 3, 325-338

Abstract: Abstract We show that for all reals c and d such that c 2 d

Keywords: Computational complexity; Time-space lower bounds; Tautologies; Satisfiability (search for similar items in EconPapers)
Date: 2011
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s10878-009-9286-x Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:jcomop:v:22:y:2011:i:3:d:10.1007_s10878-009-9286-x

Ordering information: This journal article can be ordered from
https://www.springer.com/journal/10878

DOI: 10.1007/s10878-009-9286-x

Access Statistics for this article

Journal of Combinatorial Optimization is currently edited by Thai, My T.

More articles in Journal of Combinatorial Optimization from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().