Category:NP-complete problems
From HandWiki
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 111 pages are in this category, out of 111 total.
B
C
H
I
M
S
- SameGame
- (SAT, ε-UNSAT)
- Satisfiability modulo theories
- Set cover problem
- Set splitting problem
- Set TSP problem
- Shakashaka
- Shikaku
- Slitherlink
- Smallest grammar problem
- Steiner tree problem
- String graph
- String-to-string correction problem
- Biology:Structural alignment
- Subgraph isomorphism problem
- Substructure search
- Sudoku
