counting classes Latest Research Papers

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 and the fine structure between NC1 and L

Theoretical Computer Science ◽

10.1016/j.tcs.2011.05.050 ◽

2012 ◽

Vol 417 ◽

pp. 36-49 ◽

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

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 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

Classifying Problems on Linear Congruences and Abelian Permutation Groups Using Logspace Counting Classes

Computational Complexity ◽

10.1007/s00037-009-0280-6 ◽

2009 ◽

Vol 19 (1) ◽

pp. 57-98 ◽

Cited By ~ 2

Author(s):

V. Arvind ◽

T. C. Vijayaraghavan

Keyword(s):

Permutation Groups ◽

Counting Classes ◽

Linear Congruences

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

Abelian permutation group problems and logspace counting classes

Proceedings. 19th IEEE Annual Conference on Computational Complexity, 2004. ◽

10.1109/ccc.2004.1313844 ◽

2004 ◽

Cited By ~ 1

Author(s):

V. Arvind ◽

T.C. Vijayaraghavan

Keyword(s):

Permutation Group ◽

Counting Classes

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

Acceptor-Definable Counting Classes

Advances in Informatics - Lecture Notes in Computer Science ◽

10.1007/3-540-38076-0_29 ◽

2003 ◽

pp. 453-463 ◽

Cited By ~ 3

Author(s):

Aggelos Kiayias ◽

Aris Pagourtzis ◽

Kiron Sharma ◽

Stathis Zachos

Keyword(s):

Counting Classes

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

counting classes
Recently Published Documents

TOTAL DOCUMENTS

H-INDEX

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

Counting classes and the fine structure between NC1 and L

Introduction to Counting Classes

Counting Classes and the Fine Structure between NC 1 and L

Classifying Problems on Linear Congruences and Abelian Permutation Groups Using Logspace Counting Classes

Counting classes and characters of groups of prime exponent

Abelian permutation group problems and logspace counting classes

7 Counting classes of annulus maps

Acceptor-Definable Counting Classes

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

Export Citation Format

counting classesRecently Published Documents

TOTAL DOCUMENTS

H-INDEX

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

Counting classes and the fine structure between NC1 and L

Introduction to Counting Classes

Counting Classes and the Fine Structure between NC 1 and L

Classifying Problems on Linear Congruences and Abelian Permutation Groups Using Logspace Counting Classes

Counting classes and characters of groups of prime exponent

Abelian permutation group problems and logspace counting classes

7 Counting classes of annulus maps

Acceptor-Definable Counting Classes

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

counting classes
Recently Published Documents