Abstract
We refine the techniques of Beigelet al. [4] who investigated polynomial-time counting classes, in order to make them applicable to the case of logarithmic space. We define the complexity classes
and demonstrate their significance by proving that all standard problems of linear algebra over the finite ringsZ/kZ are complete for these classes. We then define new complexity classes LogFew and LogFew
and identify them as adequate logspace versions of Few and Few
. We show that LogFew
is contained in
and that LogFew is contained in
for allk. Also an upper bound for
in terms of computation of integer determinants is given from which we conclude that all logspace counting classes are contained in
.
Similar content being viewed by others
References
E. W. Allender. The complexity of sparse sets in P. InProc. 1st Structure in Complexity Conference, pp. 1–11. Lecture Notes in Computer Science, Vol. 223. Springer-Verlag, Berlin, 1986.
C. Àlvarez and B. Jenner. A very hard log space counting class. InProc. 5th Conference on Structure in Complexity Theory, pp. 154–168, 1990.
J. L. Balcácar, J. Diaz, and J. Gabarró.Structural Complexity Theory I. Springer-Verlag, New York, 1988.
R. Beigel, J. Gill, and U. Hertrampf. Counting classes: threshold, parity, mods, and fewness. InProc. 7th STACS, pp. 49–57. Lecture Notes in Computer Science, Vol. 415. Springer-Verlag, Berlin, 1990.
S. J. Berkowitz. On computing the determinant in small parallel time using a small number of processors.Inform. process. Lett., 18:147–150, 1984.
A. Borodin, S. A. Cook, P. W. Dymond, W. L. Ruzzo, and M. Tompa. Two applications of inductive counting for complementation problems.SIAM J. Comput., 18(3):559–578, 1989.
A. Borodin, J. von zur Gathen, and J. E. Hopcroft. Fast parallel matrix and gcd computations.Inform. and Control, 52:241–256, 1982.
G. Buntrock, L. A. Hemachandra, and D. Siefkes. Using inductive counting to simulate nondeterministic computation. InProc. 15th MFCS, pp. 187–194. Lecture Notes in Computer Science, Vol. 452. Springer-Verlag, Berlin, 1990. (To appear inInform. and Comput.)
Jin-yi Cai and L. A. Hemachandra. On the power of parity polynomial time. InProc. 6th STACS, pp. 229–233. Lecture Notes in Computer Science, Vol. 349. Springer-Verlag, Berlin, 1989.
S. A. Cook. A taxonomy of problems with fast parallel algorithms.Inform. and Control, 64:2–22, 1985.
T. Gundermann, N. A. Nasser, and G. Wechsung. A survey on counting classes. InProc. 5th Conference on Structure in Complexity Theory, pp. 140–153, 1990.
N. Immerman. Nondeterministic space is closed under complement.SIAM J. Comput., 17(5): 935–938, 1988.
R. E. Ladner and N. A. Lynch. Relativization of questions about log space computability.Math. Systems Theory, 10:19–32, 1976.
K.-J. Lange and P. Rossmanith. Characterizing unambiguous augmented pushdown automata by circuits. InProc. 15th MFCS, pp. 399–406. Lecture Notes in Computer Science, Vol. 452. Springer-Verlag, Berlin, 1990.
C. Meinel.Modified Branching Programs and Their Computational Power. Lecture Notes in Computer Science, Vol. 370. Springer-Verlag, Berlin, 1989.
K. Mulmuley. A fast parallel algorithm to compute the rank of a matrix over an arbitrary field. InProc. 18th STOC, pp. 338–339, 1986.
C. H. Papadimitriou and S. K. Zachos. Two remarks on the power of counting. InProc. 6th GI Conference on Theoretical Computer Science, pp. 269–276. Lecture Notes in Computer Science, Vol. 145. Springer-Verlag, Berlin, 1983.
R. Szelepcsényi. The method of forced enumeration for nondeterministic automata.Acta Inform., 26:279–284, 1988.
J. Torán. Counting the number of solutions. InProc. 15th MFCS, pp. 121–134. Lecture Notes in Computer Science, Vol. 452. Springer-Verlag, Berlin, 1990.
L. G. Valiant. The relative complexity of checking and evaluating.Inform. Process. Lett., 5:20–23, 1976.
L. G. Valiant. The complexity of computing the permanent.Theoret. Comput. Sci., 8:189–201, 1979.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Buntrock, G., Damm, C., Hertrampf, U. et al. Structure and importance of logspace-MOD class. Math. Systems Theory 25, 223–237 (1992). https://doi.org/10.1007/BF01374526
Received:
Revised:
Accepted:
Issue Date:
DOI: https://doi.org/10.1007/BF01374526