On the Bipartite Unique Perfect Matching Problem
暂无分享,去创建一个
[1] Thomas Thierauf,et al. The complexity of the characteristic and the minimal polynomial , 2003, Theor. Comput. Sci..
[2] Vijay V. Vazirani,et al. Matching is as easy as matrix inversion , 1987, STOC.
[3] Róbert Szelepcsényi,et al. The method of forced enumeration for nondeterministic automata , 1988, Acta Informatica.
[4] Jack Edmonds,et al. Maximum matching and a polyhedron with 0,1-vertices , 1965 .
[5] Jacob T. Schwartz,et al. Fast Probabilistic Algorithms for Verification of Polynomial Identities , 1980, J. ACM.
[6] Meena Mahajan,et al. Arithmetic Complexity, Kleene Closure, and Formal Power Series , 2003, Theory of Computing Systems.
[7] Neil Immerman. Nondeterministic Space is Closed Under Complementation , 1988, SIAM J. Comput..
[8] Eric Allender,et al. The complexity of matrix rank and feasible systems of linear equations , 1999, computational complexity.
[9] Eli Upfal,et al. Constructing a perfect matching is in random NC , 1985, STOC '85.
[10] Eric Allender,et al. Isolation, Matching, and Counting Uniform and Nonuniform Upper Bounds , 1999, J. Comput. Syst. Sci..
[11] Vijay V. Vazirani,et al. Maximum Matchings in General Graphs Through Randomization , 1989, J. Algorithms.
[12] Richard Zippel,et al. Probabilistic algorithms for sparse polynomials , 1979, EUROSAM.
[13] Gary D. Stormo,et al. An RNA folding method capable of identifying pseudoknots and base triples , 1998, Bioinform..
[14] Vijay V. Vazirani,et al. NC Algorithms for Comparability Graphs, Interval Gaphs, and Testing for Unique Perfect Matching , 1985, FSTTCS.
[15] László Lovász,et al. On determinants, matchings, and random algorithms , 1979, FCT.
[16] Uzi Vishkin,et al. Constant Depth Reducibility , 1984, SIAM J. Comput..
[17] V. Vazirani,et al. NC Algorithms for Comparability Graphs, Interval Graphs, and Unique Perfect Matchings , 1986 .
[18] Haim Kaplan,et al. Unique maximum matching algorithms , 1999, STOC '99.