On helping by parity-like languages

DOI10.1016/0020-0190(94)00232-NzbMath1023.68616OpenAlexW2001401204MaRDI QIDQ1349740

Ogihara, Mitsunori

Publication date: 27 February 1997

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

Full work available at URL: https://doi.org/10.1016/0020-0190(94)00232-n

zbMATH Keywords

computational complexity

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items

The Helping Hierarchy

Cites Work

• Relations among MOD-classes
• Robust algorithms: a different approach to oracles
• On helping by robust oracle machines
• Classes of bounded nondeterminism
• Fault-tolerance and complexity (Extended abstract)
• On the power of parity polynomial time
• Counting classes: Thresholds, parity, mods, and fewness
• Unnamed Item
• Unnamed Item