The complexity of matrix rank and feasible systems of linear equations

The complexity of matrix rank and feasible systems of linear equations

[1]  Janos Simon,et al.  Space-bounded hierarchies and probabilistic computations , 1982, STOC '82.

[2]  Stephen A. Cook,et al.  Log Depth Circuits for Division and Related Problems , 1986, SIAM J. Comput..

[3]  Lane A. Hemachandra.  The Sky is Falling: The Strong Exponential Hierarchy Collapses , 1986 .

[4]  Alan L. Selman.  Proceedings of the Conference on Structure in Complexity Theory , 1986 .

[5]  Meena Mahajan,et al.  A combinatorial algorithm for the determinant , 1997, SODA '97.

[6]  Aiken,et al.  Why is Boolean Complexity Theory Di cult ? , 1992 .

[7]  Stuart J. Berkowitz,et al.  On Computing the Determinant in Small Parallel Time Using a Small Number of Processors , 1984, Inf. Process. Lett..

[8]  Oscar H. Ibarra,et al.  A Note on the Parallel Complexity of Computing the Rank of Order n Matrices , 1980, Inf. Process. Lett..

[9]  Juris Hartmanis,et al.  The Boolean Hierarchy I: Structural Properties , 1988, SIAM J. Comput..

[10]  Janos Simon.  On some central problems in computational complexity , 1975 .

[11]  Neil Immerman.  Nondeterministic Space is Closed Under Complementation , 1988, SIAM J. Comput..

[12]  Stuart A. Kurtz,et al.  Gap-Definable Counting Classes , 1994, J. Comput. Syst. Sci..

[13]  Jacob T. Schwartz,et al.  Fast Probabilistic Algorithms for Verification of Polynomial Identities , 1980, J. ACM.

[14]  L. Valiant.  Why is Boolean complexity theory difficult , 1992 .

[15]  Hermann Jung.  On Probabilistic Time and Space , 1985, ICALP.

[16]  Noam Nisan,et al.  Symmetric logspace is closed under complement , 1995, STOC '95.

[17]  A. Stephen,et al.  Gap-De nable Counting Classes , 1991 .

[18]  Stephen A. Fenner,et al.  Gap-deenable Counting Classes , 1991 .

[19]  Mark Giesbrecht,et al.  Fast computation of the Smith normal form of an integer matrix , 1995, ISSAC '95.

[20]  Mitsunori Ogihara,et al.  The PL hierarchy collapses , 1996, STOC '96.

[21]  Leslie G. Valiant,et al.  Completeness classes in algebra , 1979, STOC.

[22]  Klaus W. Wagner,et al.  Collapsing Oracle Hierarchies, Census Functions and Logarithmically Many Queries , 1988, STACS.

[23]  Juris Hartmanis,et al.  The Boolean Hierarchy II: Applications , 1989, SIAM J. Comput..

[24]  Stephen A. Cook,et al.  A Taxonomy of Problems with Fast Parallel Algorithms , 1985, Inf. Control..

[25]  László Lovász,et al.  On determinants, matchings, and random algorithms , 1979, FCT.

[26]  John T. Gill,et al.  Computational complexity of probabilistic Turing machines , 1974, STOC '74.

[27]  Mitsunori Ogihara.  Equivalence of NC^k and AC^k-1 closures of NP and Other Classes , 1995, Inf. Comput..

[28]  J. L. Balcazar.  Adaptive logspace and depth-bounded reducibilities , 1991, [1991] Proceedings of the Sixth Annual Structure in Complexity Theory Conference.

[29]  Eric Allender,et al.  Relationships among PL, #L, and the determinant , 1994, Proceedings of IEEE 9th Annual Conference on Structure in Complexity Theory.

[30]  Georg Gottlob.  Collapsing oracle-tape hierarchies , 1996, Proceedings of Computational Complexity (Formerly Structure in Complexity Theory).

[31]  Avi Wigderson,et al.  On span programs , 1993, [1993] Proceedings of the Eigth Annual Structure in Complexity Theory Conference.

[32]  K. Mulmuley.  A fast parallel algorithm to compute the rank of a matrix over an arbitrary field , 1987, Comb..

[33]  Eric Allender,et al.  Making nondeterminism unambiguous , 1997, Proceedings 38th Annual Symposium on Foundations of Computer Science.

[34]  Eric Allender,et al.  Isolation, matching, and counting , 1998, Proceedings. Thirteenth Annual IEEE Conference on Computational Complexity (Formerly: Structure in Complexity Theory Conference) (Cat. No.98CB36247).

[35]  W. T. Tutte.  The Factorization of Linear Graphs , 1947 .

[36]  John H. Reif,et al.  Synthesis of Parallel Algorithms , 1993 .

[37]  V Vinay.  Counting auxiliary pushdown automata and semi-unbounded arithmetic circuits , 1991, [1991] Proceedings of the Sixth Annual Structure in Complexity Theory Conference.

[38]  Michael Sipser,et al.  Parity, circuits, and the polynomial-time hierarchy , 1981, 22nd Annual Symposium on Foundations of Computer Science (sfcs 1981).

[39]  Seinosuke Toda.  Counting Problems Computationally Equivalent to Computing the Determinant , 1991 .

[40]  Eli Upfal,et al.  Constructing a perfect matching is in random NC , 1985, STOC '85.