Counting Classes: Thresholds, Parity, Mods, and Fewness

Authors:
Richard Beigel;John Gill;Ulrich Hertrampf
Affiliations:
-;-;-
Venue:
STACS '90 Proceedings of the 7th Annual Symposium on Theoretical Aspects of Computer Science
Year:
1990

The satanic notations: counting classes beyond #P and other definitional adventures

ACM SIGACT News
Generalized Regular Counting Classes

MFCS '99 Proceedings of the 24th International Symposium on Mathematical Foundations of Computer Science
Restrictive Acceptance Suffices for Equivalence Problems

FCT '99 Proceedings of the 12th International Symposium on Fundamentals of Computation Theory
Acceptance by Transformation Monoids (with an Application to Local Self Reductions)

CCC '97 Proceedings of the 12th Annual IEEE Conference on Computational Complexity
On functions and relations

DMTCS'03 Proceedings of the 4th international conference on Discrete mathematics and theoretical computer science

Hi-index	0.00