Cook–Levin theorem

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

Topic mentions per year

Topic mentions per year

1977-2018
012319772018

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2016
2016
The Cook-Levin theorem (the statement that SAT is NP-complete) is a central result in structural complexity theory. Is it… (More)
  • figure 11
Is this relevant?
2007
2007
As we’ve already seen in the preceding lecture, two important classes of problems we can consider are P and NP . One very… (More)
  • figure 9.2
  • figure 9.2
  • figure 9.2
  • figure 9.3
Is this relevant?
2007
2007
Parameterized complexity theory relaxes the classical notion of tractability and allows to solve some classically hard problems… (More)
  • figure 1.1
  • figure 1.2
  • figure 1.3
  • table 1.1
  • figure 2.1
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… (More)
Is this relevant?
2004
2004
This paper shows how to use sticker to construct solution space of DNA for the library sequences in the set-packing problem and… (More)
  • table 1
  • table 2
  • table 5
  • table 3
  • table 7
Is this relevant?
Highly Cited
2003
Highly Cited
2003
Recently there has been an interest in zero-knowledge protocols with stronger properties, such as concurrency, simulation… (More)
Is this relevant?
1997
1997
A completeness theory for parameterized computational complexity has been studied in a series of recent papers, and has been… (More)
Is this relevant?
Review
1995
Review
1995
This paper first surveys the near-total lack of superlinear lower bounds in complexity theory, for “natural” computational… (More)
Is this relevant?
1993
1993
A detailed model of a random access computation over an ab stract domain is presented and the existence of an NP complete problem… (More)
Is this relevant?
1985
1985
algebra 32,50, 58<lb>Abstract data types 28, 67, 86, 87, 101,<lb>105, lIO<lb>Abstract syntax 154<lb>Abstraction 23,29, 31, 53, 55… (More)
Is this relevant?