Constructing a perfect matching is in random NC
Combinatorica
NP is as easy as detecting unique solutions
Theoretical Computer Science
A Las Vegas RNC algorithm for maximum matching
Combinatorica
Matching is as easy as matrix inversion
Combinatorica
On the power of two-point based sampling
Journal of Complexity
NC algorithms for computing the number of perfect matchings in K3,3-free graph and related problems
Information and Computation
Fast parallel algorithms for sparse multivariate polynomial interpolation over finite fields
SIAM Journal on Computing
Randomized polynomials, threshold circuits, and the polynomial hierarchy
STACS 91 Proceedings of the 8th annual symposium on Theoretical aspects of computer science
PP is as hard as the polynomial-time hierarchy
SIAM Journal on Computing
SIAM Journal on Computing
SODA '92 Proceedings of the third annual ACM-SIAM symposium on Discrete algorithms
Random pseudo-polynomial algorithms for exact matroid problems
Journal of Algorithms
Sublinear-time parallel algorithms for matching and related problems
Journal of Algorithms
The complexity of restricted spanning tree problems
Journal of the ACM (JACM)
NC Algorithms for Comparability Graphs, Interval Gaphs, and Testing for Unique Perfect Matching
Proceedings of the Fifth Conference on Foundations of Software Technology and Theoretical Computer Science
The Matching Problem for Strongly Chordal Graphs is in $NC$
The Matching Problem for Strongly Chordal Graphs is in $NC$
On randomization in sequential and distributed algorithms
ACM Computing Surveys (CSUR)
Randomness vs. fault-tolerance
PODC '97 Proceedings of the sixteenth annual ACM symposium on Principles of distributed computing
Isolating an Odd Number of Elements and Applications in Complexity Theory
Theory of Computing Systems
| Hi-index | 0.00 |