Randomness-optimal unique element isolation, with applications to perfect matching and related problems
暂无分享,去创建一个
[1] Howard J. Karloff. A las vegas rnc algorithm for maximum matching , 1986, Comb..
[2] Allan Borodin,et al. Parallel Computation for Well-Endowed Rings and Space-Bounded Probabilistic Machines , 1984, Inf. Control..
[3] Oded Goldreich,et al. On the power of two-point based sampling , 1989, J. Complex..
[4] Marek Karpinski,et al. The Matching Problem for Strongly Chordal Graphs is in $NC$ , 1986 .
[5] Leslie G. Valiant,et al. NP is as easy as detecting unique solutions , 1985, STOC '85.
[6] Andrew V. Goldberg,et al. Sublinear-Time Parallel Algorithms for Matching and Related Problems , 1993, J. Algorithms.
[7] Andrew V. Goldberg,et al. Using Interior-Point Methods for Fast Parallel Algorithms for Bipartite Matching and Related Problems , 1992, SIAM J. Comput..
[8] Jacobo Torán,et al. Turing Machines with Few Accepting Computations and Low Sets for PP , 1992, J. Comput. Syst. Sci..
[9] L. Csanky,et al. Fast Parallel Matrix Inversion Algorithms , 1976, SIAM J. Comput..
[10] Marek Karpinski,et al. Fast Parallel Algorithms for Sparse Multivariate Polynomial Interpolation over Finite Fields , 1988, SIAM J. Comput..
[11] Michael O. Rabin,et al. N-Process Mutual Exclusion with Bounded Waiting by 4 Log_2 N-Valued Shared Variable , 1982, J. Comput. Syst. Sci..
[12] Seinosuke Toda,et al. PP is as Hard as the Polynomial-Time Hierarchy , 1991, SIAM J. Comput..
[13] Mihalis Yannakakis,et al. The complexity of restricted spanning tree problems , 1982, JACM.
[14] Vijay V. Vazirani,et al. NC Algorithms for Computing the Number of Perfect Matchings in K_3,3-Free Graphs and Related Problems , 1989, Inf. Comput..
[15] Pravin M. Vaidya,et al. Reducing the parallel complexity of certain linear programming problems , 1990, Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science.
[16] Francesco Maffioli,et al. Random Pseudo-Polynomial Algorithms for Exact Matroid Problems , 1992, J. Algorithms.
[17] Jin-Yi Cai,et al. On the Power of Parity Polynomial Time , 1989, STACS.
[18] Eli Upfal,et al. Constructing a perfect matching is in random NC , 1985, STOC '85.
[19] Jun Tarui. Randomized Polynomials, Threshold Circuits, and the Polynomial Hierarchy , 1991, STACS.
[20] Vijay V. Vazirani,et al. NC Algorithms for Comparability Graphs, Interval Gaphs, and Testing for Unique Perfect Matching , 1985, FSTTCS.
[21] Vijay V. Vazirani,et al. Matching is as easy as matrix inversion , 1987, STOC.
[22] Larry Carter,et al. Universal Classes of Hash Functions , 1979, J. Comput. Syst. Sci..
[23] Gary L. Miller,et al. Flow in planar graphs with multiple sources and sinks , 1989, 30th Annual Symposium on Foundations of Computer Science.
[24] Lov K. Grover. Fast Parallel Algorithms for Bipartite Matching , 1992, IPCO.
[25] Vijay V. Vazirani,et al. Randomized parallel algorithms for matroid union and intersection, with applications to arboresences and edge-disjoint spanning trees , 1992, SODA '92.
[26] Leonard M. Adleman,et al. Two theorems on random polynomial time , 1978, 19th Annual Symposium on Foundations of Computer Science (sfcs 1978).
[27] Jacobo Torán,et al. Turning machines with few accepting computations and low sets for PP , 1989, [1989] Proceedings. Structure in Complexity Theory Fourth Annual Conference.
[28] Marek Karpinski,et al. The matching problem for bipartite graphs with polynomially bounded permanents is in NC , 1987, 28th Annual Symposium on Foundations of Computer Science (sfcs 1987).