Relationships Among PL, #L, and the Determinant

@article{Allender1996RelationshipsAP,
  title={Relationships Among PL, #L, and the Determinant},
  author={E. Allender and M. Ogihara},
  journal={RAIRO Theor. Informatics Appl.},
  year={1996},
  volume={30},
  pages={1-21}
}
Recent results by Toda, Vinay, Damm, and Valiant have shown that the complexity of the determinant is characterized by the complexity ofcounting the number ofaccepting computations ofa nondeterministic logspace-bounded machine. (This class of functions is known as #L) By using that characterization and by establishing a few elementary closure properties, we give a very simple proof of theorem of Jung, showing that probabilistic logspace-bounded (PL) machines lose none of their computational… Expand
122 Citations
Nondeterministic NC 1 Computation.
  • 92
Isolation, Matching, and Counting Uniform and Nonuniform Upper Bounds
  • 88
  • PDF
Counting classes and the fine structure between NC1 and L
  • 8
  • PDF
Verifying the determinant in parallel
  • 12
  • Highly Influenced
Arithmetic Circuits and Counting Complexity Classes
  • 51
  • PDF
Bounded Depth Arithmetic Circuits: Counting and Closure
  • 29
  • PDF
Arithmetic Circuits and the Hadamard Product of Polynomials
  • 28
  • PDF
Emptiness problems for integer circuits
  • PDF
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 42 REFERENCES
Adaptive logspace and depth-bounded reducibilities
  • J. Balcázar
  • Computer Science
  • [1991] Proceedings of the Sixth Annual Structure in Complexity Theory Conference
  • 1991
  • 7
  • PDF
Counting auxiliary pushdown automata and semi-unbounded arithmetic circuits
  • V. Vinay
  • Mathematics, Computer Science
  • [1991] Proceedings of the Sixth Annual Structure in Complexity Theory Conference
  • 1991
  • 133
  • PDF
A Very Hard log-Space Counting Class
  • 114
Two Applications of Inductive Counting for Complementation Problems
  • 153
  • PDF
Depth reduction for noncommutative arithmetic circuits
  • 23
PP is closed under intersection
  • 145
Gap-Definable Counting Classes
  • 130
The Power of the Middle Bit of a #P Function
  • 59
  • PDF
Complexity classes defined by counting quantifiers
  • J. Torán
  • Mathematics, Computer Science
  • JACM
  • 1991
  • 116
...
1
2
3
4
5
...