strong NP-completeness
Sign in to saveproperty of computational problems that is a special case of NP-completeness
In the Vinony graph
Vinony's link graph records 29 inbound references to strong NP-completeness, and connects out to International Standard Book Number, digital object identifier and International Standard Serial Number.
Vinony files it under Complexity classes, Computational complexity theory and Strongly NP-complete problems.
Vinony links it to 5 Wikipedia language editions.
Connections
International Standard Book Number
Entity
digital object identifier
Entity
International Standard Serial Number
Entity
exponential function
Entity
dynamic programming
Entity
positional notation
Entity
computational complexity theory
Entity
Q22908627
Entity
unary numeral system
Entity
binary code
Entity
NP-complete
Entity
knapsack problem
Entity
time complexity
Entity
NP-hard
Entity
Mathematical Reviews
Entity
David S. Johnson
Entity
partition problem
Entity
Unary coding
Entity
bin packing problem
Entity
pseudo-polynomial time
Entity