Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

32

CC
2006
Springer

favoriteEmaildiscussreport

101views System Software» more CC 2006»

Inductive Time-Space Lower Bounds for Sat and Related Problems

13 years 11 months ago

Inductive Time-Space Lower Bounds for Sat and Related Problems

Download www.cs.cmu.edu

We improve upon indirect diagonalization arguments for lower bounds on explicit problems within the polynomial hierarchy. Our contributions are summarized as follows.

Ryan Williams

Real-time Traffic

CC 2006 | Explicit Problems | Indirect Diagonalization Arguments | Lower Bounds | System Software |

claim paper

Related Content

» Better TimeSpace Lower Bounds for SAT and Related Problems

» A Quantum TimeSpace Lower Bound for the Counting Hierarchy

» Quantum TimeSpace Tradeoffs for Sorting

» Structural Relaxations by Variable Renaming and Their Compilation for Solving MinCostSAT

» If NP Languages are Hard on the WorstCase Then It is Easy to Find Their Hard Instances

» If NP Languages are Hard on the WorstCase Then it is Easy to Find Their Hard Instances

» A Phase TransitionBased Perspective on Multiple Instance Kernels

» Modular static scheduling of synchronous dataflow networks an efficient symbolic represent...

» Planning Graphs and Knowledge Compilation

Post Info
More Details (n/a)

Added	11 Dec 2010
Updated	11 Dec 2010
Type	Journal
Year	2006
Where	CC
Authors	Ryan Williams

Comments (0)