Sciweavers

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

105

Voted

COCO
2005
Springer

89views Algorithms» more COCO 2005»

Better Time-Space Lower Bounds for SAT and Related Problems

15 years 8 months ago

Better Time-Space Lower Bounds for SAT and Related Problems

Download www.cs.cmu.edu

Ryan Williams

Real-time Traffic

COCO 2005 |

claim paper

Related Content

» Inductive TimeSpace Lower Bounds for Sat and Related Problems

» A Quantum TimeSpace Lower Bound for the Counting Hierarchy

» Study of Lower Bound Functions for MAX2SAT

» Exploiting Inference Rules to Compute Lower Bounds for MAXSAT Solving

» Quantum TimeSpace Tradeoffs for Sorting

» Improving Exact Algorithms for MAX2SAT

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

» Size Bounds and Query Plans for Relational Joins

» Algorithmics in Exponential Time

Post Info
More Details (n/a)

Added	26 Jun 2010
Updated	26 Jun 2010
Type	Conference
Year	2005
Where	COCO
Authors	Ryan Williams

Comments (0)