The Helping Hierarchy

DOI10.1051/ITA:2001101zbMATH Open1052.68050OpenAlexW2078623815MaRDI QIDQ4331052FDOQ4331052

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

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

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Robust algorithms: a different approach to oracles
• On helping by robust oracle machines
• Revisiting a result of Ko
• Title not available (Why is that?)
• Title not available (Why is that?)
• Helping by unambiguous computation and probabilistic computation
• Self-witnessing polynomial-time complexity and prime factorization
• Title not available (Why is that?)
• Title not available (Why is that?)
• On helping by parity-like languages

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)