Sciweavers

Share
CC
2006
Springer

Inductive Time-Space Lower Bounds for Sat and Related Problems

9 years 10 months ago
Inductive Time-Space Lower Bounds for Sat and Related Problems
We improve upon indirect diagonalization arguments for lower bounds on explicit problems within the polynomial hierarchy. Our contributions are summarized as follows.
Ryan Williams
Added 11 Dec 2010
Updated 11 Dec 2010
Type Journal
Year 2006
Where CC
Authors Ryan Williams
Comments (0)
books