The chain method to separate counting classes

DOI10.1007/S002240000080zbMath0893.68070OpenAlexW2058279779WikidataQ126436402 ScholiaQ126436402MaRDI QIDQ1384716

K. Cronauer, Heribert Vollmer, Ulrich Hertrampf, Klaus W. Wagner

Publication date: 20 April 1998

Published in: Theory of Computing Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s002240000080

zbMATH Keywords

probabilistic Turing machinecounting classes

Mathematics Subject Classification ID

Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Related Items (2)

Hierarchies and reducibilities on regular languages related to modulo counting ⋮ A reducibility for the dot-depth hierarchy

This page was built for publication: The chain method to separate counting classes