Sciweavers

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

4

COCO
2003
Springer

favoriteEmaildiscussreport

98views Algorithms» more COCO 2003»

The Complexity of Unique k-SAT: An Isolation Lemma for k-CNFs

13 years 9 months ago

The Complexity of Unique k-SAT: An Isolation Lemma for k-CNFs

Download www.ti.inf.ethz.ch

Chris Calabro, Russell Impagliazzo, Valentine Kaba

Real-time Traffic

COCO 2003 |

claim paper

Post Info
More Details (n/a)

Added	06 Jul 2010
Updated	06 Jul 2010
Type	Conference
Year	2003
Where	COCO
Authors	Chris Calabro, Russell Impagliazzo, Valentine Kabanets, Ramamohan Paturi

Comments (0)