Improved processor bounds for algebraic and combinatorial problems in RNC
Authors:
- 1 January 1985
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 2 (02725428) , 490-495
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- Efficient parallel solution of linear systems1985
- Fast and efficient parallel algorithms for the exact inversion of integer matricesLecture Notes in Computer Science, 1985
- Constructing a perfect matching is in random NC1985
- Fast parallel matrix and GCD computations1982
- On the Asymptotic Complexity of Matrix MultiplicationSIAM Journal on Computing, 1982
- Fast Probabilistic Algorithms for Verification of Polynomial IdentitiesJournal of the ACM, 1980
- Approximate algorithms to derive exact solutions to systems of linear equations1979
- An improved parallel processor bound in fast matrix inversionInformation Processing Letters, 1978
- Fast Parallel Matrix Inversion AlgorithmsSIAM Journal on Computing, 1976
- Algebraic algorithms using p-adic constructions1976