Skip to search formSkip to main content
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
Finding a small spectral approximation for a tall $n \times d$ matrix $A$ is a fundamental numerical primitive. For a number of… Expand
  • figure 1
  • figure 2
  • figure 3
Is this relevant?
Highly Cited
2012
Highly Cited
2012
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
Abstract Benthic macrofauna and sediment column features were sampled at five stations along a bathymetric transect (depths 140… Expand
  • table 1
  • table 2
  • figure 1
  • table 3
  • figure 2
Is this relevant?
Highly Cited
2004
Highly Cited
2004
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
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
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
  • table 1
  • figure 1
  • figure 2
Is this relevant?
2002
2002
Kolmogorov (1974) proposed a non-probabilistic approach to statistics, an individual combinatorial relation between the data and… Expand
  • figure 1
Is this relevant?
Highly Cited
1999
Highly Cited
1999
Recently, a number of authors have proposed treating dialogue systems as Markov decision processes (MDPs). However, the practical… Expand
  • figure 1
  • figure 2
Is this relevant?
Highly Cited
1996
Highly Cited
1996
Under the hypothesis that NP does not have p-measure 0 (roughly, that NP contains more than a negligible subset of exponential… Expand
  • figure 1
  • figure 2
Is this relevant?
Highly Cited
1989
Highly Cited
1989
Preface. Approaches to Knowledge Acquisition from Text and Pictures. Problems in Knowledge Acquisition from Text and Pictures (S… Expand
Is this relevant?