Skip to content

Sections

Maps Timeline Graph Cosmos Life Culture Innovation People Climate Trends Art

Browse Dictionary Books Food Places Asteroids Search

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

strong NP-completeness · Vinony

🌐English

English Español Polski Português فارسی 中文

EntityQ7624684· pop 5· linked from 29 articles

strong NP-completeness

property of computational problems that is a special case of NP-completeness

Available in 5 languages

Español
Português
Polski
فارسی

via Wikidata sitelinks · CC0

Connections

International Standard Book Number

digital object identifier

Categories

Complexity classes Computational complexity theory Strongly NP-complete problems

Sources

wikipedia.externallinksexternallink

International Standard Serial Number

Entity

exponential function

dynamic programming

positional notation

computational complexity theory

unary numeral system

knapsack problem

time complexity

Mathematical Reviews

David S. Johnson

partition problem

bin packing problem

pseudo-polynomial time

Sign in to save

What links here29 pages

pseudo-polynomial time

bin packing problem

maximum flow problem

partition problem

knapsack problem

machine learning

independent set

unary numeral system

Similar entities

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

computational hardness assumption

Entitydist 0.37

Entitydist 0.42

Entitydist 0.45

list of NP-complete problems

Entitydist 0.46

Entitydist 0.48

Entitydist 0.48

Category:Theorems in computational complexity theory

Entitydist 0.49

computational complexity theory

Entitydist 0.50

Entitydist 0.52

Turing reduction

Entitydist 0.52

Entitydist 0.53

Entitydist 0.53