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

Semantic Scholar uses AI to extract papers important to this topic.

2016

2016

- Damiano Mazza
- LICS
- 2016

The Cook-Levin theorem (the statement that SAT is NP-complete) is a central result in structural complexity theory. Is it… (More)

Is this relevant?

2007

2007

- Shuchi Chawla
- 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)

Is this relevant?

2007

2007

- Tarique Islam
- 2007

Parameterized complexity theory relaxes the classical notion of tractability and allows to solve some classically hard problems… (More)

Is this relevant?

2004

2004

- Ruben Gamboa, John R. Cowles
- TPHOLs
- 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

- Michael Ho, Weng-Long Chang, Minyi Guo, Laurence Tianruo Yang
- IEICE Transactions
- 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)

Is this relevant?

Highly Cited

2003

Highly Cited

2003

- Juan A. Garay, Philip D. MacKenzie, Ke Yang
- Journal of Cryptology
- 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

- Kenneth W. Regan
- Structure in Complexity Theory Conference
- 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

- Nimrod Megiddo
- 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

- Mary Shaw, James J Driscoll, +5 authors William L. Scherlis
- Springer New York
- 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?