Cook–Levin theorem

Cook–Levin theorem

Uncommon

Rarity: Uncommon

A topic a little better known than average, read and translated beyond its own country.

Rarity follows how well known the article is: its views on the French and English Wikipedia over a year, and the number of languages it exists in.

At a glance

Class
Notion
Domain
Science and technology
In collections
Nobody has pulled it yet.

What Wikipedia says

In computational complexity theory, the Cook–Levin theorem, also known as Cook's theorem, states that the Boolean satisfiability problem is NP-complete. That is, it is in NP, and any problem in NP can be reduced in polynomial time by a deterministic Turing machine to the Boolean satisfiability problem.

Excerpt from the Wikipedia article “Cook–Levin theorem”, under the CC BY-SA 4.0 license. Read the article on Wikipedia

Open free boosters and add Cook–Levin theorem to your collection.

Play for free

Related cards