Unions of Disjoint NP-Complete Sets

DOI10.1007/978-3-642-22685-4_22zbMath1353.68101OpenAlexW55187247MaRDI QIDQ5894221

Stephen Travers, Christian Glaßer, A. Pavan, John M. Hitchcock

Publication date: 17 August 2011

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-22685-4_22

Mathematics Subject Classification ID

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

This page was built for publication: Unions of Disjoint NP-Complete Sets