Improved processor bounds for combinatorial problems in RNC
- 1 June 1988
- journal article
- research article
- Published by Springer Nature in Combinatorica
- Vol. 8 (2) , 189-200
- https://doi.org/10.1007/bf02122800
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- Matching is as easy as matrix inversionCombinatorica, 1987
- Matrix multiplication via arithmetic progressionsPublished by Association for Computing Machinery (ACM) ,1987
- Fast and efficient parallel algorithms for the exact inversion of integer matricesPublished by Springer Nature ,1985
- Constructing a perfect matching is in random NCPublished by Association for Computing Machinery (ACM) ,1985
- On computing the determinant in small parallel time using a small number of processorsInformation Processing Letters, 1984
- Parallel computation for well-endowed rings and space-bounded probabilistic machinesInformation and Control, 1983
- Fast parallel matrix and GCD computationsInformation and Control, 1982
- Fast Probabilistic Algorithms for Verification of Polynomial IdentitiesJournal of the ACM, 1980
- An improved parallel processor bound in fast matrix inversionInformation Processing Letters, 1978