Math Conjectures
HomeReferencesImpagliazzoPaturi2001ETH

ImpagliazzoPaturi2001ETH

On the complexity of k-SAT

Russell Impagliazzo and Ramamohan Paturi

misc2001
Citation key
ImpagliazzoPaturi2001ETH
Year
2001
Cited by
2 catalog records
Direct source
Available

Reference note

Why this source is in the ledger

Russell Impagliazzo and Ramamohan Paturi, “On the complexity of k-SAT,” Journal of Computer and System Sciences 62 (2001), 367–375, DOI: 10.1006/jcss.2000.1727.

Catalog connections

Conjectures citing this source

Source record

Bibliographic fields

Inspect the parsed BibTeX fields
author
Russell Impagliazzo and Ramamohan Paturi
doi
10.1006/jcss.2000.1727
note
Russell Impagliazzo and Ramamohan Paturi, “On the complexity of k-SAT,” Journal of Computer and System Sciences 62 (2001), 367--375, DOI: 10.1006/jcss.2000.1727.
title
On the complexity of k-SAT
year
2001