Mathematical Foundations of Computer Science 2005

DOI10.1007/11549345MaRDI QIDQ5492874zbMATH OpenOpenAlexFDO

Authors Christian Glaßer, Ogihara, Mitsunori, Aduri Pavan, Alan L. Selman, Liyu Zhang

Publication date 20 October 2006

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

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

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)

Recommendations

• Autoreducibility, mitoticity, and immunity
• Redundancy in Complete Sets
• Autoreducibility and mitoticity of logspace-complete sets for NP and other classes
• Autoreducibility of complete sets for log-space and polynomial-time reductions
• Autoreducibility and mitoticity of logspace-complete sets for NP and other classes

Cited in

(12)

• Splitting NP-Complete Sets
• Redundancy in Complete Sets
• Pushdown dimension
• Autoreducibility, mitoticity, and immunity
• Probabilistic autoreductions
• Non-mitotic Sets
• Query-monotonic Turing reductions
• On the autoreducibility of functions
• Autoreducibility of complete sets for log-space and polynomial-time reductions
• Theory and Applications of Models of Computation
• Strong self-reducibility precludes strong immunity
• Properties of NP‐Complete Sets

This page was built for publication: Mathematical Foundations of Computer Science 2005

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5492874)