Verifying the determinant in parallel

Computational Complexity

Volumn 7, Issue 2, 1998, Pages 128-151

  Santha, Miklos ^a   Sovanna, Tan ^b  

^a CNRS   (France)

^b UNIVERSITÉ PARIS EST CRÉTEIL   (France)

Author keywords

Complexity classes; Linear algebra; Parallel computing; Program checking; Verification

Indexed keywords

EID: 0040098265     PISSN: 10163328     EISSN: None     Source Type: Journal    
DOI: 10.1007/PL00001596     Document Type: Article

References (23)

1. E. ALLENDER AND M. OGIHARA, Relationships Among PL, #L , and the Determinant. In Proc. 9th Ann. IEEE Conf. Structure in Complexity Theory, 1994, 267-278.
2. M. BEN-OR AND R. CLEVE, Computing Algebraic Formulas using a Constant Number of Registers. In Proc. Twentieth Ann. ACM Symp. Theor. Comput., 1988, 254-257.
3. S. J. BERKOWITZ, On computing the determinant in small parallel time using a small number of processors. Inform. Process. Lett. 18 (1984), 147-150.
4. M. BLUM AND S. KANNAN, Designing Programs that Check Their Work. J. Assoc. Comput. Mach. 42 (1995), 269-291.
5. A. BORODIN, S. COOK AND N. PIPPENGER, Parallel computation for well-endowed ring and space-Bounded probabilistic machines. Inform. and Control 48 (1983), 113-136.
6. A. BORODIN, J. VON ZUR GATHEN AND J. HOPCROFT, Fast parallel matrix and GCD computation. Inform. and Control 52 (1982), 241-256.
7. A. L. CHISTOV, Fast parallel calculation of the rank of matrices over a field of arbitrary characteristic. Proc. International Conference on Foundations of Computation Theory, Lecture Notes in Computer Science 199 (1985), 63-69.
8. S. A. COOK, A taxonomy of problems with fast parallel algorithms. Inform. and Control 64 (1985), 2-22.
9. L. CSANKY, Fast Parallel Matrix Inversion Algorithms. SIAM J. Comput. 5(4) (1976), 618-623.
10. #L. Informatik-Preprint, Fachbereich Informatik der Humboldt-Universität zu Berlin, 8, 1991.
11. J. DIXON, An isomorphism criterion for modules over a principal ideal domain. Linear and Multilinear Algebra 8 (1979), 69-72.
12. S. FENNER, L. FORTNOW AND S. KURTZ, Gap-definable counting classes. In Proc. 6th Ann. IEEE Conf. Structure in Complexity Theory, 1991, 30-42.
13. 2 algorithm for testing similarity of matrices. Inform. Process. Lett. 30 (1989), 253-254.
14. J. VON ZUR GATHEN, Parallel Linear Algebra. In Synthesis of Parallel Algorithms, chapter 13, ed. J. H. REIF. Morgan Kaufmann Publishers, 1993, 574-615.
15. O. H. IBARRA, S. MORAN AND L.E. ROSIER, A note on the parallel complexity of computing the rank of order n matrices. Inform. Process. Lett. 11 (1980), 162.
16. S. KANNAN, Program Checkers for algebraic problems. PhD thesis, International Computer Science Institute, Berkeley, CA, 1989.
17. K. MULMULEY, A fast parallel algorithm to compute the rank of a matrix over an arbitrary field. Combinatorica 7 (1987), 101-104.
18. W. Ruzzo, On uniform circuit complexity. J. Comput. System Sci. 22 (1981), 365-383.
19. S. TODA, Counting Problems Computationally Equivalent to Computing the Determinant. Tech. Rep. CSIM 91-07, 1991.
20. J. TORÁN, Complexity classes defined by counting quantifiers. J. Assoc. Comput. Mach. 38 (1991), 753-744.
21. L.G. VALIANT, Completeness classes in algebra. In Proc. Eleventh Ann. ACM Symp. Theor. Comput., 1979, 249-261.
22. L.G. VALIANT, Why is Boolean complexity theory difficult? In London Mathematical Society Lecture Notes Series 16(9), ed. M. S. PATERSON. Cambridge University Press, 1992.
23. V. VINAY, Counting auxiliary pushdown automata and semi-unbounded arithmetic circuits. In Proc. 6th Ann. IEEE Conf. Structure in Complexity Theory, 1991, 270-284.