Inverse HAMILTONIAN CYCLE and Inverse 3-D MATCHING Are coNP-Complete (Q5459120)
From MaRDI portal
scientific article; zbMATH DE number 5267591
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Inverse HAMILTONIAN CYCLE and Inverse 3-D MATCHING Are coNP-Complete |
scientific article; zbMATH DE number 5267591 |
Statements
Inverse HAMILTONIAN CYCLE and Inverse 3-D MATCHING Are coNP-Complete (English)
0 references
24 April 2008
0 references
computational complexity
0 references
coNP-completeness
0 references
inverse NP-problems
0 references
Hamiltonian Cycle
0 references
3-Dimensional Matching
0 references
