The chain method to separate counting classes

DOI10.1007/S002240000080MaRDI QIDQ1384716zbMATH OpenOpenAlexWikidataFDO

Authors K. Cronauer, Ulrich Hertrampf, Heribert Vollmer, K. 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

counting classesprobabilistic Turing machine

Mathematics Subject Classification ID

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

Recommendations

• Classes of bounded counting type and their inclusion relations
• scientific article; zbMATH DE number 4041255
• Complexity classes defined by counting quantifiers
• scientific article; zbMATH DE number 1222829

Cited in

(5)

• A reducibility for the dot-depth hierarchy
• Hierarchies and reducibilities on regular languages related to modulo counting
• scientific article; zbMATH DE number 1222829 (Why is no real title available?)
• Complexity classes defined by counting quantifiers
• Classes of bounded counting type and their inclusion relations

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1384716)