On probabilistic tape complexity and fast circuits for matrix inversion problems
- 1 January 1984
- book chapter
- Published by Springer Nature
- p. 281-291
- https://doi.org/10.1007/3-540-13345-3_25
Abstract
No abstract availableThis publication has 12 references indexed in Scilit:
- Fast parallel matrix and GCD computationsInformation and Control, 1982
- Space-bounded hierarchies and probabilistic computationsPublished by Association for Computing Machinery (ACM) ,1982
- On uniform circuit complexityJournal of Computer and System Sciences, 1981
- Space-bounded probabilistic turing machine complexity classes are closed under complement (Preliminary Version)Published by Association for Computing Machinery (ACM) ,1981
- Probabilistic two-way machinesLecture Notes in Computer Science, 1981
- Relationships between probabilistic and deterministic tape complexityPublished by Springer Nature ,1981
- Random walks, universal traversal sequences, and the complexity of maze problemsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1979
- On Relating Time and Space to Size and DepthSIAM Journal on Computing, 1977
- Computational Complexity of Probabilistic Turing MachinesSIAM Journal on Computing, 1977
- Fast Parallel Matrix Inversion AlgorithmsSIAM Journal on Computing, 1976