Introduction to Counting Classes

Texts in Computer Science - Computability and Complexity Theory ◽

10.1007/978-1-4614-0682-2_11 ◽

2011 ◽

pp. 247-260

Author(s):

Steven Homer ◽

Alan L. Selman

Keyword(s):

Counting Classes

Download Full-text

Counting classes and characters of groups of prime exponent

Israel Journal of Mathematics ◽

10.1007/bf02773832 ◽

2006 ◽

Vol 156 (1) ◽

pp. 205-220 ◽

Cited By ~ 1

Author(s):

Noboru Ito ◽

Avinoam Mann

Keyword(s):

Counting Classes ◽

Prime Exponent

Download Full-text

Counting classes are at least as hard as the polynomial-time hierarchy

[1991] Proceedings of the Sixth Annual Structure in Complexity Theory Conference ◽

10.1109/sct.1991.160238 ◽

2002 ◽

Cited By ~ 9

Author(s):

S. Toda ◽

M. Ogiwara

Keyword(s):

Polynomial Time ◽

Counting Classes ◽

Polynomial Time Hierarchy

Download Full-text

7 Counting classes of annulus maps

Lecture Notes in Mathematics - Combinations of Complex Dynamical Systems ◽

10.1007/978-3-540-39936-0_7 ◽

2003 ◽

pp. 83-88

Author(s):

Kevin M. Pilgrim

Keyword(s):

Counting Classes

Download Full-text

Relativized counting classes: Relations among thresholds, parity, and mods

Journal of Computer and System Sciences ◽

10.1016/0022-0000(91)90040-c ◽

1991 ◽

Vol 42 (1) ◽

pp. 76-96 ◽

Cited By ~ 29

Author(s):

Richard Beigel

Keyword(s):

Counting Classes

Download Full-text

Gap-definable counting classes

[1991] Proceedings of the Sixth Annual Structure in Complexity Theory Conference ◽

10.1109/sct.1991.160241 ◽

2002 ◽

Cited By ~ 29

Author(s):

S.A. Fenner ◽

L.J. Fortnow ◽

S.A. Kurtz

Keyword(s):

Counting Classes

Download Full-text

Generalized Regular Counting Classes

Lecture Notes in Computer Science - Mathematical Foundations of Computer Science 1999 ◽

10.1007/3-540-48340-3_38 ◽

1999 ◽

pp. 419-429 ◽

Cited By ~ 1

Author(s):

Ulrich Hertrampf

Keyword(s):

Counting Classes

Download Full-text

The BP-Operator and the Power of Counting Classes

Gems of Theoretical Computer Science ◽

10.1007/978-3-642-60322-8_20 ◽

1998 ◽

pp. 163-174

Author(s):

Uwe Schöning ◽

Randall Pruim

Keyword(s):

Counting Classes

Download Full-text

Characterizations and Approximability of Hard Counting Classes Below $$\#\mathsf {P}$$

Lecture Notes in Computer Science - Theory and Applications of Models of Computation ◽

10.1007/978-3-030-59267-7_22 ◽

2020 ◽

pp. 251-262

Author(s):

Eleni Bakali ◽

Aggeliki Chalki ◽

Aris Pagourtzis

Keyword(s):

Counting Classes

Download Full-text

Counting Classes are at Least as Hard as the Polynomial-Time Hierarchy

SIAM Journal on Computing ◽

10.1137/0221023 ◽

1992 ◽

Vol 21 (2) ◽

pp. 316-328 ◽

Cited By ~ 75

Author(s):

Seinosuke Toda ◽

Mitsunori Ogiwara

Keyword(s):

Polynomial Time ◽

Counting Classes ◽

Polynomial Time Hierarchy

Download Full-text

Counting Classes and the Fine Structure between NC 1 and L

Mathematical Foundations of Computer Science 2010 - Lecture Notes in Computer Science ◽

10.1007/978-3-642-15155-2_28 ◽

2010 ◽

pp. 306-317 ◽

Cited By ~ 2

Author(s):

Samir Datta ◽

Meena Mahajan ◽

B. V. Raghavendra Rao ◽

Michael Thomas ◽

Heribert Vollmer

Keyword(s):

Fine Structure ◽

Counting Classes

Download Full-text