Revisiting a result of Ko

DOI10.1016/S0020-0190(97)00197-XzbMath1336.68087MaRDI QIDQ286990

Patrizio Cintioli, Riccardo Silvestri

Publication date: 26 May 2016

Published in: Information Processing Letters (Search for Journal in Brave)

zbMATH Keywords

computational complexitytheory of computationrobust algorithmsrelativizations

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Related Items (1)

The Helping Hierarchy

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Helping by unambiguous computation and probabilistic computation
• Robust algorithms: a different approach to oracles
• On helping by robust oracle machines
• Self-reducibility
• Fault-tolerance and complexity (Extended abstract)

This page was built for publication: Revisiting a result of Ko