Survey of polynomial transformations between NP-complete problems
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3571502 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 3225808 (Why is no real title available?)
- scientific article; zbMATH DE number 3302125 (Why is no real title available?)
- scientific article; zbMATH DE number 3311755 (Why is no real title available?)
- A comparison of polynomial time reducibilities
- Recursively enumerable sets of positive integers and their decision problems
- Survey of polynomial transformations between NP-complete problems
- The complexity of theorem-proving procedures
Cited in
(5)- IS CAUSAL REASONING HARDER THAN PROBABILISTIC REASONING?
- Survey of polynomial transformations between NP-complete problems
- A useful transform of standard input data for a classical NP-complete problem
- A graph-transformational approach for proving the correctness of reductions between NP-problems
- On limitations of transformations between combinatorial problems
This page was built for publication: Survey of polynomial transformations between NP-complete problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q555184)