The complexity of matrix rank and feasible systems of linear equations

Computational Complexity

Volumn 8, Issue 2, 1999, Pages 99-126

  Allender, Eric ^a   Beals, Robert ^b   Ogihara, Mitsunori ^c  

^a RUTGERS UNIVERSITY   (United States)

^b University of Arizona   (United States)

^c University of Rochester   (United States)

Author keywords

L; Linear algebra; Logspace counting; Probabilistic logspace; Rank

Indexed keywords

EID: 0033478153     PISSN: 10163328     EISSN: None     Source Type: Journal    
DOI: 10.1007/s000370050023     Document Type: Article

References (46)

1. E. ALLENDER AND M. OGIHARA, Relationships among PL, #L, and the determinant. Theoretical Informatics and Applications (RAIRO) 30(1) (1996), 1-21.
2. E. ALLENDER AND K. REINHARDT, Isolation, matching, and counting. In Proceedings of 13th Conference on Computational Complexity. IEEE Computer Society Press, Los Alamitos, CA, 1998, 92-88.
3. L. BABAI, A. GÁL, AND A. WIGDERSON, Superpolynomial lower bounds for monotone span programs. Technical Report 96-37, DIMACS, 1996. To appear in Combinatorica.
4. J. BALCÁZAR, Adaptive logspace and depth-bounded reducibilities. In Proceedings of 6th Conference on Structure in Complexity Theory. IEEE Computer Society Press, Los Alamitos, CA, 1990, 240-254.
5. P. BEAME, S. COOK, AND H. HOOVER, Log depth circuits for division and related problems. SIAM Journal on Computing 15(4) (1986), 994-1003.
6. R. BEIGEL AND B. FU, Circuits over PP and PL. In Proceedings of 11th Computational Complexity. IEEE Computer Society Press, Los Alamitos, CA, 1997, 24-35.
7. S. BERKOWITZ, On computing the determinant in small parallel time using a small number of processors. Information Processing Letters 18 (1984), 147-150.
8. G. BUNTROCK, C. DAMM, U. HERTRAMPF, AND C. MEINEL, Structure and importance of Logspace-MOD class. Mathematical Systems Theory 25 (1992), 223-237.
9. J. CAI, T. GUNDERMANN, J. HARTMANIS, L. HEMACHANDRA, V. SEWELSON, K. WAGNER, AND G. WECHSUNG, The boolean hierarchy I: structural properties. SIAM Journal on Computing 17(6) (1988), 1232-1252.
10. J. CAI, T. GUNDERMANN, J. HARTMANIS, L. HEMACHANDRA, V. SEWELSON, K. WAGNER, AND G. WECHSUNG, The boolean hierarchy II: Applications. SIAM Journal on Computing 18(1) (1989), 95-111.
11. S. COOK, A taxonomy of problems with fast parallel algorithms. Information and Computation 64 (1985), 2-22.
12. #L? Informatik-Preprint 8, Fachbereich Informatik der Humboldt-Universität zu Berlin, 1991.
13. S. FENNER, L. FORTNOW, AND S. KURTZ, Gap-definable counting classes. Journal of Computer and System Sciences 48(1) (1994), 116-148.
14. M. FURST, J. SAXE, AND M. SIPSER, Parity, circuits, and the polynomial-time hierarchy. Mathematical Systems Theory 17 (1984), 13-27.
15. J. VON ZUR GATHEN, Parallel linear algebra. In Synthesis of Parallel Algorithms, ed. J. REIF, 574-615. Morgan Kaufmann, 1993.
16. M. GIESBRECHT, Fast computation of the Smith normal form of an integer matrix. In Proceedings of Symposium on Symbolic and Algebraic Computation. ACM Press, 1995, 173-186.
17. J. GILL, Computational complexity of probabilistic Turing machines. SIAM Journal on Computing 6(4) (1977), 675-695.
18. G. GOTTLOB, Collapsing oracle-tape hierarchies. In Proceedings of 10th Computational Complexity. IEEE Computer Society Press, Los Alamitos, CA, 1996, 33-42.
19. L. HEMACHANDRA, The strong exponential hierarchy collapses. Journal of Computer and System Sciences 39 (1989), 299-322.
20. N. IMMERMAN, Nondeterministic space is closed under complementation. SIAM Journal on Computing 17 (1988), 935-938.
21. H. JUNG, On probabilistic time and space. In Proceedings of 12th Conference on Automata, Languages and Programming. Springer-Verlag Lecture Notes in Computer Science 194, 1985, 310-317.
22. E. KALTOFEN, 1995. Personal communication.
23. M. KARCHMER AND A. WIGDERSON, On span programs. In Proceedings of 8th Conference on Structure in Complexity Theory. IEEE Computer Society Press, Los Alamitos, CA, 1993, 102-111.
24. R. KARP, E. UPFAL, AND A. WIGDERSON, Constructing a perfect matching in random NC. Combinatorica 6(1) (1986), 35-48.
25. L. LOVÁSZ, On determinants, matching, and random algorithms. In Fundamentals of Computing Theory (Proceedings of Conference on Algebraic, Arithmetic and Categorical Methods in Computation Theory, Berlin/Wendisch-Rietz, 1979), Berlin, 1979, Akademia-Verlag, 565-574.
26. V. MAHAJAN AND V. VINAY, A combinatorial algorithm for the determinant. Chicago Journal on Theoretical Computer Science 1997 (1997). Article 5.
27. K. MULMULEY, A fast parallel algorithm to compute the rank of a matrix over an arbitrary field. Combinatorica 7(1) (1987), 101-104.
28. N. NISAN AND A. TA-SHMA, Symmetric logspace is closed under complement. Chicago Journal on Theoretical Computer Science 1995 (1995), Article 1.
29. k-1 closures of NP and other classes. Information and Computation 120(1) (1995), 55-58.
30. M. OGIHARA, The PL hierarchy collapses. SIAM Journal on Computing 27 (1998), 1430-1437.
31. K. REINHARDT AND E. ALLENDER, Making nondeterminism unambiguous. In Proceedings of 36th Symposium on Foundations of Computer Science. IEEE Computer Society Press, Los Alamitos, CA, 1997, 244-253. To appear in SIAM Journal on Computing.
32. W. RUZZO, On uniform circuit complexity. Journal of Computer and System Sciences 22 (1981), 365-383.
33. W. RUZZO, J. SIMON, AND M. TOMPA, Space-bounded hierarchies and probabilistic computations. Journal of Computer and System Sciences 28 (1984), 216-230.
34. M. SANTHA AND S. TAN, Verifying the determinant in parallel. computational complexity 7 (1998), 128-151.
35. U. SCHÖNING AND K. WAGNER, Collapsing oracle hierarchies, census functions, and logarithmically many queries. In Proceedings of 5th Symposium on Theoretical Aspects of Computer Science, 91-97. Springer-Verlag Lecture Notes in Computer Science 294, 1988.
36. J. SCHWARTZ, Fast probabilistic algorithms for verification of polynomial identities. Journal of the Association for Computing Machinery 27 (1980), 701-717.
37. J. SIMON, On some central problems in computational complexity. PhD thesis, Cornell University, Ithaca, NY, 1975. Available as Cornell Department of Computer Science Technical Report TR75-224.
38. R. SZELEPCSÉNYI, The method of forced enumeration for nondeterministic automata. Acta Informatica 26 (1988), 279-284.
39. S. TODA, Counting problems computationally equivalent to computing the determinant. Technical Report CSIM 91-07, Department of Computer Science, University of Electro-Communications, Tokyo, Japan, 1991.
40. W. TUTTE, The factorization of linear graphs. Journal of the London Mathematical Society 22 (1947), 107-111.
41. L. VALIANT, Completeness classes in algebra. In Proceedings of 11th Symposium on Theory of Computing. ACM Press, 1979, 249-261.
42. L. VALIANT, Why is boolean complexity theory difficult? In Boolean Function Complexity, ed. M. PATERSON, 84-94. London Mathematical Society, Lecture Note Series 169, Cambridge University Press, 1992.
43. V. VINAY, Counting auxiliary pushdown automata and semi-unbounded arithmetic circuits. In Proceedings of 6th Conference on Structure in Complexity Theory. IEEE Computer Society Press, Los Alamitos, CA, 1991, 270-284.
44. V. VINAY, 1995. Personal communication.
45. K. WAGNER, The complexity of combinatorial problems with succinct input representation. Acta Informatica 23 (1986), 325-356.
46. A. WIGDERSON, NL/poly ⊆ ⊕L/poly. In Proceedings of 9th Conference on Structure in Complexity Theory. IEEE Computer Society Press, Los Alamitos, CA, 1994, 59-62.