Comparing Reductions to NP-Complete Sets

DOI10.1007/11786986_41zbMath1223.68046OpenAlexW2109436746MaRDI QIDQ3613782

John M. Hitchcock, A. Pavan

Publication date: 12 March 2009

Published in: Automata, Languages and Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11786986_41

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Related Items (4)

Non-uniform reductions ⋮ The complexity of unions of disjoint sets ⋮ Non-mitotic Sets ⋮ Non-mitotic sets

This page was built for publication: Comparing Reductions to NP-Complete Sets