Skip to content

Sections

Maps Timeline Graph Cosmos Life Culture Innovation People Climate Trends Art

© 2026 Vinony · Knowledge from Wikipedia, Wikidata, and 27 public APIs.

Cook–Levin theorem · Vinony

EntityQ377276· pop 21· linked from 39 articles

Cook–Levin theorem

Sign in to save

theorem that Boolean satisfiability is NP-complete and therefore that NP-complete problems exist

Connections

International Standard Book Number

digital object identifier

mathematical logic

logical conjunction

logical operator

theoretical computer science

P versus NP problem

Boolean data type

computational complexity theory

Richard M. Karp

Categories

Theorems in computational complexity theory

Sources

wikipedia.externallinksexternallink

Similar entities

Discovered by embedding cosine similarity (sentence-transformers MiniLM, 384-dim).

true quantified Boolean formula

Entitydist 0.44

Karp's 21 NP-complete problems

Entitydist 0.54

Boolean algebra

Entitydist 0.56

quantum complexity theory

Entitydist 0.67

rxponential hierarchy

Entitydist 0.70

Entitydist 0.70

Entitydist 0.71

quantum Turing machine

Entitydist 0.72

Satyrium aciculare

Entitydist 0.72

Julian Abele Cook Jr.

Entitydist 0.72

Entitydist 0.72

Entitydist 0.73

What links here39 pages

true quantified Boolean formula

P versus NP problem

boolean satisfiability problem

parameterized complexity

science and technology in Ukraine

computational complexity theory

history of artificial intelligence

subgraph isomorphism problem

Karp's 21 NP-complete problems

Turing machine equivalents