Toggle navigation
PDFSEARCH.IO
Document Search Engine - browse more than 18 million documents
Sign up
Sign in
Back to Results
First Page
Meta Content
View Document Preview and Link
EATCS-IPEC Nerode Prize 2013 On the Exact Complexity of Evaluating Quantified k-CNF Chris Calabro, Russell Impagliazzo, Ramamohan Paturi, Algorithmica 2013 The complexity of Unique k-SAT: An Isolation Lemma for k-CNFs
Add to Reading List
Document Date: 2013-09-30 10:45:02
Open Document
File Size: 78,72 KB
Share Result on Facebook
UPDATE
EATCS-IPEC Nerode Prize 2013 On the Exact Complexity of Evaluating Quantified k-CNF Chris Calabro, Russell Impagliazzo, Ramamohan Paturi, Algorithmica 2013 The complexity of Unique k-SAT: An Isolation Lemma for k-CNFs