On the Complexity of k-SAT
Impagliazzo, Russell, Paturi, Ramamohan
Published in Journal of computer and system sciences (01.03.2001)
Published in Journal of computer and system sciences (01.03.2001)
Get full text
Journal Article
Complexity of k-SAT
Impagliazzo, R., Paturi, R.
Published in Proceedings. Fourteenth Annual IEEE Conference on Computational Complexity (Formerly: Structure in Complexity Theory Conference) (Cat.No.99CB36317) (1999)
Published in Proceedings. Fourteenth Annual IEEE Conference on Computational Complexity (Formerly: Structure in Complexity Theory Conference) (Cat.No.99CB36317) (1999)
Get full text
Conference Proceeding
Journal Article
Which Problems Have Strongly Exponential Complexity?
Impagliazzo, Russell, Paturi, Ramamohan, Zane, Francis
Published in Journal of computer and system sciences (01.12.2001)
Published in Journal of computer and system sciences (01.12.2001)
Get full text
Journal Article
The complexity of unique k-SAT: an isolation lemma for k-CNFs
Calabro, C., Impagliazzo, R., Kabanets, V., Paturi, R.
Published in 18th IEEE Annual Conference on Computational Complexity, 2003. Proceedings (2003)
Published in 18th IEEE Annual Conference on Computational Complexity, 2003. Proceedings (2003)
Get full text
Conference Proceeding
Program Speedup in a Heterogeneous Computing Network
Donaldson, V., Berman, F., Paturi, R.
Published in Journal of parallel and distributed computing (01.06.1994)
Published in Journal of parallel and distributed computing (01.06.1994)
Get full text
Journal Article
A duality between clause width and clause density for SAT
Calabro, C., Impagliazzo, R., Paturi, R.
Published in 21st Annual IEEE Conference on Computational Complexity (CCC'06) (2006)
Published in 21st Annual IEEE Conference on Computational Complexity (CCC'06) (2006)
Get full text
Conference Proceeding
Which problems have strongly exponential complexity?
Impagliazzo, R., Paturi, R., Zane, F.
Published in Annual Symposium on Foundations of Computer Science (1998)
Published in Annual Symposium on Foundations of Computer Science (1998)
Get full text
Conference Proceeding
Journal Article
Satisfiability Coding Lemma
Paturi, R., Pudlak, P., Zane, F.
Published in Annual Symposium on Foundations of Computer Science (1997)
Published in Annual Symposium on Foundations of Computer Science (1997)
Get full text
Conference Proceeding
Journal Article
An improved exponential-time algorithm for k-SAT
Paturi, R., Pudlik, P., Saks, M.E., Zane, F.
Published in Annual Symposium on Foundations of Computer Science (1998)
Published in Annual Symposium on Foundations of Computer Science (1998)
Get full text
Conference Proceeding
Journal Article
On threshold circuits for parity
Paturi, R., Saks, M.E.
Published in Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science (1990)
Published in Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science (1990)
Get full text
Conference Proceeding