You are currently offline. Some features of the site may not work correctly.

# Cook–Levin theorem

Known as: Cook-Levin theorem, Cock Levin, Cook levin theorem
In computational complexity theory, the Cook–Levin theorem, also known as Cook's theorem, states that the Boolean satisfiability problem is NP… Expand
Wikipedia

## Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2016
2016
• APPROX-RANDOM
• 2016
• Corpus ID: 9314971
Finding a small spectral approximation for a tall $n \times d$ matrix $A$ is a fundamental numerical primitive. For a number of… Expand
Is this relevant?
Highly Cited
2012
Highly Cited
2012
• EUROCRYPT
• 2012
• Corpus ID: 16994254
We devise the first identity-based encryption (IBE) that remains secure even when the adversary is equipped with auxiliary input… Expand
Is this relevant?
Highly Cited
2009
Highly Cited
2009
• 2009
• Corpus ID: 33285828
Abstract Benthic macrofauna and sediment column features were sampled at five stations along a bathymetric transect (depths 140… Expand
Is this relevant?
Highly Cited
2004
Highly Cited
2004
• Public Key Cryptography
• 2004
• Corpus ID: 47425263
We give a simple and efficient construction of a verifiable random function (VRF) on bilinear groups. Our construction is direct… Expand
Is this relevant?
2004
2004
• TPHOLs
• 2004
• Corpus ID: 533875
As is the case with many theorems in complexity theory, typical proofs of the celebrated Cook-Levin theorem showing the NP… Expand
Is this relevant?
2003
2003
• J. Econ. Theory
• 2003
• Corpus ID: 6720836
We consider a setting in which the buyer's ability to hold up a seller's investment is so severe that there is no investment in… Expand
Is this relevant?
2002
2002
• The 43rd Annual IEEE Symposium on Foundations of…
• 2002
• Corpus ID: 1487442
Kolmogorov (1974) proposed a non-probabilistic approach to statistics, an individual combinatorial relation between the data and… Expand
Is this relevant?
Highly Cited
1999
Highly Cited
1999
• NIPS
• 1999
• Corpus ID: 6543198
Recently, a number of authors have proposed treating dialogue systems as Markov decision processes (MDPs). However, the practical… Expand
Is this relevant?
Highly Cited
1996
Highly Cited
1996
• Theor. Comput. Sci.
• 1996
• Corpus ID: 15845883
Under the hypothesis that NP does not have p-measure 0 (roughly, that NP contains more than a negligible subset of exponential… Expand
Is this relevant?
Highly Cited
1989
Highly Cited
1989
• 1989
• Corpus ID: 60877367
Preface. Approaches to Knowledge Acquisition from Text and Pictures. Problems in Knowledge Acquisition from Text and Pictures (S… Expand
Is this relevant?