Sciweavers

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

89

Voted

FTTCS
2006

49views more FTTCS 2006»

A Survey of Lower Bounds for Satisfiability and Related Problems

15 years 3 months ago

A Survey of Lower Bounds for Satisfiability and Related Problems

Download pages.cs.wisc.edu

Dieter van Melkebeek

Real-time Traffic

FTTCS 2006 |

claim paper

Related Content

» Sufficient Conditions for Intractability over BlackBox Groups Generic Lower Bounds for Gen...

» A Quantum TimeSpace Lower Bound for the Counting Hierarchy

» New algorithms for singly linearly constrained quadratic programs subject to lower and upp...

» Inductive TimeSpace Lower Bounds for Sat and Related Problems

» Lower Bounds for High Dimensional Nearest Neighbor Search and Related Problems

» Better TimeSpace Lower Bounds for SAT and Related Problems

» The satisfiability threshold for randomly generated binary constraint satisfaction problem...

» Lower bounds for the relative greedy algorithm for approximating Steiner trees

» Sublinear Communication Protocols for MultiParty Pointer Jumping and a Related Lower Bound

Post Info
More Details (n/a)

Added	12 Dec 2010
Updated	12 Dec 2010
Type	Journal
Year	2006
Where	FTTCS
Authors	Dieter van Melkebeek

Comments (0)