Comparing Reductions to NP-Complete Sets

DOI10.1007/11786986_41zbMath1223.68046MaRDI QIDQ3613782

A. Pavan, John M. Hitchcock

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

68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)

68Q15: Complexity classes (hierarchies, relations among complexity classes, etc.)

Related Items

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