Skip to content

Sections

Maps Timeline Graph Cosmos Life Culture Innovation People Climate Trends Art

Browse Dictionary Books Search

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

Karp's 21 NP-complete problems · Vinony

🌐English

English Deutsch Español Français Italiano Nederlands Português Русский فارسی 中文日本語

EntityQ1734364· pop 14· linked from 31 articles

Karp's 21 NP-complete problems

set of computational problems

Available in 14 languages

Español
Français
Deutsch
中文
Русский
Português
Italiano
Hebrew
Nederlands
Romanian

Connections

computational complexity theory

Richard M. Karp

Categories

Mathematics-related lists NP-complete problems

Sources

wikipedia.externallinksexternallink

via Wikidata sitelinks · CC0

computer science

Entity

International Standard Book Number

digital object identifier

P versus NP problem

knapsack problem

time complexity

boolean satisfiability problem

independent set

conjunctive normal form

Cook–Levin theorem

integer programming

Sign in to save

What links here31 pages

3-dimensional matching

P versus NP problem

integer programming

boolean satisfiability problem

linear programming

Hamiltonian path problem

Cook–Levin theorem

history of artificial intelligence

Richard M. Karp

clique cover problem

feedback vertex set

Feedback arc set

knapsack problem

Similar entities

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

Cook–Levin theorem

Entitydist 0.54

rxponential hierarchy

Entitydist 0.62

Horton 96-graph

Entitydist 0.63

quantum complexity theory

Entitydist 0.64

Entitydist 0.66

Dinic's algorithm

Entitydist 0.67

Shor's algorithm

Entitydist 0.67

Entitydist 0.67

Category:Quantum algorithms

Entitydist 0.68

Gilbert–Varshamov bound

Entitydist 0.68

great icosidodecahedron

Entitydist 0.69

great truncated cuboctahedron

Entitydist 0.69