Constructing a perfect matching is in random NC
Authors:
- 1 March 1986
- journal article
- Published by Springer Nature in Combinatorica
- Vol. 6 (1) , 35-48
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- The two-processor scheduling problem is in R-NC1985
- Are search and decision programs computationally equivalent?1985
- Parallel computation for well-endowed rings and space-bounded probabilistic machinesInformation and Control, 1983
- An overview of computational complexityCommunications of the ACM, 1983
- The maximum flow problem is log space complete for PTheoretical Computer Science, 1982
- Fast Probabilistic Algorithms for Verification of Polynomial IdentitiesJournal of the ACM, 1980
- Fast probabilistic algorithms for hamiltonian circuits and matchingsJournal of Computer and System Sciences, 1979
- Theoretical Improvements in Algorithmic Efficiency for Network Flow ProblemsJournal of the ACM, 1972
- Systems of distinct representatives and linear algebraJournal of Research of the National Bureau of Standards Section B Mathematics and Mathematical Physics, 1967
- The Factors of GraphsCanadian Journal of Mathematics, 1952