The Helping Hierarchy

DOI10.1051/ITA:2001101MaRDI QIDQ4331052zbMATH OpenOpenAlexFDO

Authors Patrizio Cintioli, Riccardo Silvestri

Publication date 2001

Published in RAIRO - Theoretical Informatics and Applications (Search for Journal in Brave)

Full work available at URL http://www.numdam.org/item?id=ITA_2001__35_4_367_0, https://eudml.org/doc/222020

Mathematics Subject Classification ID

Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Complexity of computation (including implicit computational complexity) (03D15)

Recommendations

• On helping by robust oracle machines
• Helping by unambiguous computation and probabilistic computation
• scientific article; zbMATH DE number 1555928
• On helping by parity-like languages
• ON HELPING AND INTERACTIVE PROOF SYSTEMS

Cites work

• scientific article; zbMATH DE number 4022646 (Why is no real title available?)
• scientific article; zbMATH DE number 46423 (Why is no real title available?)
• scientific article; zbMATH DE number 192916 (Why is no real title available?)
• scientific article; zbMATH DE number 4126690 (Why is no real title available?)
• scientific article; zbMATH DE number 578252 (Why is no real title available?)
• Helping by unambiguous computation and probabilistic computation
• On helping by parity-like languages
• On helping by robust oracle machines
• Revisiting a result of Ko
• Robust algorithms: a different approach to oracles
• Self-witnessing polynomial-time complexity and prime factorization

This page was built for publication: The Helping Hierarchy

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