Category:NP-complete problems
From HandWiki
Revision as of 17:24, 28 February 2021 by imported>Corlink (add)
Here is a list of articles in the category NP-complete problems of the Computing portal that unifies foundations of mathematics and computations using computers. ==See also==
Pages in category "NP-complete problems"
The following 87 pages are in this category, out of 87 total.
H
L
M
S
- SameGame
- (SAT, ε-UNSAT)
- Satisfiability modulo theories
- Set cover problem
- Set packing
- Set splitting problem
- Set TSP problem
- Shakashaka
- Shortest common supersequence
- Shortest common supersequence problem
- Shortest total path length spanning tree
- Slitherlink
- Steiner tree problem
- Subgraph isomorphism problem
- Sudoku
