Splitting NP-Complete Sets
From MaRDI portal
Publication:3532575
DOI10.1137/060673886zbMath1151.68024OpenAlexW2061352247MaRDI QIDQ3532575
A. Pavan, Liyu Zhang, Christian Glaßer, Selman, Alan L.
Publication date: 28 October 2008
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/060673886
Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)
Related Items (6)
Autoreducibility and mitoticity of logspace-complete sets for NP and other classes ⋮ Polynomial-time axioms of choice and polynomial-time cardinality ⋮ Introduction to Autoreducibility and Mitoticity ⋮ Weak mitoticity of bounded disjunctive and conjunctive truth-table autoreducible sets ⋮ Unions of Disjoint NP-Complete Sets ⋮ Non-mitotic sets
This page was built for publication: Splitting NP-Complete Sets
