Abstract
We investigate the complexity of enumerative approximation of two elementary problems in linear algebra, computing the rank and the determinant of a matrix. In particular, we show that if there exists an enumerator that, given a matrix, outputs a list of constantly many numbers, one of which is guaranteed to be the rank of the matrix, then it can be determined in AC0 (with oracle access to the enumerator) which of these numbers is the rank. Thus, for example, if the enumerator is an FL function, then the problem of computing the rank is in FL. The result holds for matrices over any commutative ring whose size grows at most polynomially with the size of the matrix. The existence of such an enumerator also implies a slightly stronger collapse of the exact counting logspace hierarchy. For the determinant function we establish the following two results: (1) If the determinant is poly-enumerable in logspace, then it can be computed exactly in FL. (2) For any prime p, if computing the determinant modulo p is (p-1)-enumerable in FL, then computing the determinant modulo p can be done in FL. This gives a new perspective on the approximability of many elementary linear algebra problems equivalent to computing the rank or the determinant.
This work is supported in part by NSF grants EIA-0080124 and DUE-9980943, and in part by NIH grants RO1-AG18231 and P30-AG18254.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
Allender, E. (1997). A clarification concerning the #L hierarchy. Available at http://www.cssutgers.edu/~allender/.
Allender, E., Beals, R., and Ogihara, M. (1999). The complexity of matrix rank and feasible systems of linear equations. Computational Complexity, 8: 99–126.
Allender, E. and Ogihara, M. (1996). Relationships among PL, #L, and the determinant. Theoretical Informatics and Applications, 30 (1): 1–21.
Amir, A., Beigel, R., and Gasarch, W. (1990). Some connections between bounded query classes and nonuniform complexity. In 5th Structure in Complexity Theory Conference, pages 232–243.
Barrington, D. and Immerman, N. (1997). Time, hardware, and uniformity. In Hemaspaandra, L. and Selman, A., editors, Complexity Theory Restrospective II,pages 1–22. Springer-Verlag.
Beigel, R. and Fu, B. (1997). Circuits over PP and PL. In 12st IEEE Conference on Computational Complexity, pages 24–35.
Beygelzimer, A. and Ogihara, M. (2002). On the enumerability of the determinant and the rank. Electronic Colloquium on Computational Complexity TR02–016.
Buntrock, G., Damm, C., Hertrampf, U., and Meinel, C. (1992). Structure and importance of Logspace-MOD class. Mathematical Systems Theory, 25 (3): 223–237.
Cai, J. and Hemachandra, L. (1989). Enumerative counting is hard. Information and Computation, 82 (1): 34–44.
Cai, J. and Hemachandra, L. (1991). A note on enumerative counting. Information Processing Letters, 38: 215–219.
Cook, S. (1985). A taxonomy of problems with fast parallel algorithms. Information and Control, 64: 2–22.
Damm, C. (1991). DET = L#L? Informatik-Preprint 8, Fachbereich Informatik der Humboldt-Universität zu Berlin.
de Bruijn, N. G. (1970). Asymptotic methods in analysis. North-Holland, Amsterdam.
Lovâsz, L. (1993). Combinatorial problems and exercises. North-Holland, 2nd edition.
Ogihara, M. (1995). Polynomial-time membership comparable sets. SIAM Journal on Computing, 24 (5): 1168–1181.
Ogihara, M. (1998). The PL hierarchy collapses. SIAM Journal on Computing, 27: 1430 1437.
Ogihara, M. and Tantau, T. (2001). On the reducibility of sets inside NP to sets with low information content. Preprint.
Ruzzo, W. (1981). On uniform circuit complexity. Journal of Computer and System Sciences, 22 (3): 365–383.
Ruzzo, W., Simon, J., and Tompa, M. (1984). Space-bounded hierarchies and probabilistic computations. Journal of Computer and System Sciences, 28: 216–230.
Santha, M. and Tan, S. (1998). Verifying the determinant in parallel. Computational Complexity, 7:128–151.
Stockmeyer, L. (1985). On approximation algorithms for #P. SIAM Journal on Computing, 14 (4): 849–861.
Toda, S. (1989). On the computational power of PP and P. In 30th IEEE Symposium on Foundations of Computer Science, pages 514–519.
Toda, S. (1991). Counting problems computationally equivalent to computing the determinant. Technical Report CSIM 91–07, Department of Computer Science, University of Electro-Communications, Tokyo, Japan.
Valiant, L. (1979). The complexity of computing the permanent. Theoretical Computer Science, 8: 189–201.
Valiant, L. (1992). Why is boolean complexity theory difficult. In Paterson, M., editor, Boolean Function Complexity,London Mathematical Society Lecture Notes Series 169, pages 84–94. Cambridge University Press.
Vinay, V. (1991). Counting auxiliary pushdown automata and semi-unbounded arithmetic circuits. In 6th IEEE Structure in Complexity Theory Conference, pages 270–284.
von zur Gathen, J. (1993). Parallel linear algebra. In Reif, J., editor, Synthesis of Parallel Algorithms,pages 574–615. Morgan Kaufmann.
Wilson, C. (1985). Relatizived circuit complexity. Journal of Computer and System Sciences, 31: 169–181.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer Science+Business Media New York
About this chapter
Cite this chapter
Beygelzimer, A., Ogihara, M. (2002). On the Enumerability of the Determinant and the Rank. In: Baeza-Yates, R., Montanari, U., Santoro, N. (eds) Foundations of Information Technology in the Era of Network and Mobile Computing. IFIP — The International Federation for Information Processing, vol 96. Springer, Boston, MA. https://doi.org/10.1007/978-0-387-35608-2_6
Download citation
DOI: https://doi.org/10.1007/978-0-387-35608-2_6
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4757-5275-5
Online ISBN: 978-0-387-35608-2
eBook Packages: Springer Book Archive