Redundancy in Complete Sets

DOI10.1007/11672142_36zbMath1136.68027OpenAlexW1564226119MaRDI QIDQ5449820

Christian Glaßer, Selman, Alan L., A. Pavan, Liyu Zhang

Publication date: 19 March 2008

Published in: STACS 2006 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11672142_36

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) Other degrees and reducibilities in computability and recursion theory (03D30)

Related Items (6)

Autoreducibility, mitoticity, and immunity ⋮ Space-efficient informational redundancy ⋮ The complexity of unions of disjoint sets ⋮ The fault tolerance of NP-hard problems ⋮ The Fault Tolerance of NP-Hard Problems ⋮ Non-mitotic Sets

This page was built for publication: Redundancy in Complete Sets