Mathematical Foundations of Computer Science 2005

DOI10.1007/11549345MaRDI QIDQ5492867zbMATH OpenOpenAlexFDO

Authors Piotr Faliszewski, Ogihara, Mitsunori

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

Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Recommendations

• On the autoreducibility of functions
• Autoreducibility of complete sets for log-space and polynomial-time reductions
• Separating Complexity Classes Using Autoreducibility
• Autoreducibility of NP-complete sets under strong hypotheses
• Autoreducibility of NP-complete sets

Cited in

(9)

• Selfdecomposability and selfsimilarity: a concise primer
• Sparse selfreducible sets and nonuniform lower bounds
• Self-reducibility
• Remarks on the selfdecomposability and new examples
• Length-increasing reductions for PSPACE-completeness
• scientific article; zbMATH DE number 4022646 (Why is no real title available?)
• Autoreducibility of NP-complete sets
• Mathematical Foundations of Computer Science 2005
• On the autoreducibility of functions

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 Q5492867)