Isolation, matching, and counting

Proceedings of the Annual IEEE Conference on Computational Complexity

Volumn , Issue , 1998, Pages 92-100

  Allender, E ^a   Reinhardt, K ^b  

^a RUTGERS UNIVERSITY   (United States)

^b UNIVERSITY OF TÜBINGEN   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

COMPLEXITY CLASS; MATCHING PROBLEMS; PERFECT MATCHINGS; UPPER BOUND;

COMPUTATIONAL COMPLEXITY;

EID: 84947220454     PISSN: 10930159     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/CCC.1998.694594     Document Type: Conference Paper

References (29)

1. [ABO97] E. Allender, R. Beals, and M. Ogihara. The complexity of matrix rank and feasible systems of linear equations. DIMACS technical report 97-40, submitted for publication, a preliminary version appeared in STOC 96, 1997.
2. [AJ93] C. Álvarez and B. Jenner. A very hard log-space counting class. Theoretical Computer Science, 107:3-30, 1993.
3. [All97] E. Allender. Making computation count: Arithmetic circuits in the nineties. SIGACT NEWS, 28(4):2-15, December 1997.
4. [AO96] E. Allender and M. Ogihara. Relationships among PL, #L, and the determinant. RAIRO - Theoretical Information and Application, 30:1-21, 1996.
5. [AS92] N. Alon and J. Spencer. The Probabilistic Method. John Wiley and Sons, 1992.
6. [AZ98] E. Allender and Shiyu Zhou. Uniform inclusions in nondeterministic logspace. Manuscript, 1998.
7. [BCH86] P. W. Beame, S. A. Cook, and H. J. Hoover. Log depth circuits for division and related problems. SIAM Journal on Computing, 15:994-1003, 1986.
8. [BCP83] A. Borodin, S. Cook, and N. Pippenger. Parallel Computation for Well-Endowed Rings and Space-Bounded Probabilistic Machines. Inf. Control, 58(1-3):113-136, 1983.
9. [BDHM92] Gerhard Buntrock, Carsten Damm, Ulrich Hertrampf, and Christoph Meinel. Structure and importance of logspace-MOD class. Math. Systems Theory, 25:223-237, 1992.
10. [BF97] R. Beigel and B. Fu. Circuits over PP and PL. In IEEE Conference on Computational Complexity, pages 24-35, 1997.
11. [BGW] L. Babai, A. Gál, and A. Wigderson. Superpolynomial lower bounds for monotone span programs. DIMACS Technical Report 96-37.
12. [CG88] B. Chor and O. Goldreich. Unbiased bits from sources of weak randomness and probabilistic communication complexity. SIAM J. Comput., 17(2):230-261, April 1988.
13. [Edm65] J. Edmonds. Matching and a polyhedron with O-1 vertices. J. Res. Natl. Bur. Stand., 69:125-130, 1965.
14. [FFK94] Stephen A. Fenner, Lance J. Fortnow, and Stuart A. Kurtz. Gap-definable counting classes. Journal of Computer and System Sciences, 48:116-148, 1994.
15. [Gil77] J. Gill. Computational complexity of probabilistic Turing machines. SIAM J. Comput., 6(4):675-695, December 1977.
16. [Imm88] N. Immerman. Nondeterministic space is closed under complement. SIAM Journal on Computing, 17:935-938, 1988.
17. [KUW86] R.M. Karp, E. Upfal, and A. Wigderson. Constructing a perfect matching is in random NC. Combinatorica, 6(1):35-48, 1986.
18. [MV97] M. Mahajan and V. Vinay. Determinant: Combinatorics, algorithms, and complexity. Chicago Journal of Theoretical Computer Science, (5), 1997.
19. [MVV87] K. Mulmuley, U. Vazirani, and V. Vazirani. Matching is as easy as matrix inversion. Combinatorica, 7:105-113, 1987.
20. [NW94] N. Nisan and A. Wigderson. Hardness vs. randomness. Journal of Computer and System Sciences, 49:149-167, 1994.
21. [Ogi96] M. Ogihara. The PL hierarchy collapses. In ACM Symposium on Theory of Computing (STOC), pages 84-88, 1996. to appear in SIAM J. Comput.
22. [RA97] K. Reinhardt and E. Allender. Making nondeterminism unambiguous. In 38 th IEEE Symposium on Foundations of Computer Science (FOCS), pages 244-253, 1997.
23. [RST84] W. L. Ruzzo, J. Simon, and M. Tompa. Space-bounded hierarchies and probabilistic computations. Journal of Computer and System Sciences, 28:216-230, 1984.
24. [ST94] M. Santha and S. Tan. Verifying the Determinant. In Proceedings of the 5th Symposium on Algorithms and Computation, LNCS 834, pages 65-73. Springer-Verlag, 1994.
25. [Sze88] R. Szelepcsényi. The method of forced enumeration for nondeterministic automata. Acta Informatica, 26:279-284, 1988.
26. [Tod92] S. Toda. Classes of arithmetic circuits capturing the complexity of computing the determinant. IEICE Trans. Inf. and Syst., E75-D:116-124, 1992.
27. [Ven91] H. Venkateswaran. Properties that characterize LOGCFL. Journal of Computer and System Sciences, 43:380-404, 1991.
28. [Wig95] Avi Wigderson. Lectures on the fusion method and derandomization. Technical Report SOCS-95.2,School of Computer Science, McGill University, 1995.
29. [Wig97] Avi Wigderson. Personal communication. 1997.