On helping by parity-like languages
From MaRDI portal
Publication:1349740
DOI10.1016/0020-0190(94)00232-NzbMath1023.68616MaRDI QIDQ1349740
Publication date: 27 February 1997
Published in: Information Processing Letters (Search for Journal in Brave)
68Q45: Formal languages and automata
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- 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