Computational complexity of some problems of linear algebra

Journal of Computer and System Sciences

Volumn 58, Issue 3, 1999, Pages 572-596

  Buss, Jonathan F ^a   Frandsen, Gudmund S ^b   Shallit, Jeffrey O ^a  

^a UNIVERSITY OF WATERLOO   (Canada)

^b AARHUS UNIVERSITY   (Denmark)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL METHODS; LINEAR ALGEBRA; LINGUISTICS; MATRIX ALGEBRA; OPTIMIZATION; POLYNOMIALS;

MATRIX RANK; MAXIMUM RANK; MINIMUM RANK;

COMPUTATIONAL COMPLEXITY;

EID: 0032679680     PISSN: 00220000     EISSN: None     Source Type: Journal    
DOI: 10.1006/jcss.1998.1608     Document Type: Article

References (33)

1. J. Berstel and C. Reutenauer, "Rational Series and Their Languages," EATCS Monographs on Theoretical Computer Science, Vol. 12, Springer-Verlag, New York/Berlin, 1988.
2. A. Borodin, J. von zur Garthen, and J. Hopcroft, Fast parallel matrix and GCD computations, Inform. Control 52 (1982), 241-256.
3. J. Canny, Some algebraic and geometric computations in PSPACE, in "Proc. Twentieth ACM Symp. Theor. Comput., 1988," pp. 460-467.
4. L. Egidi, The complexity of the theory of p-adic numbers, in "Proc. 34th Ann. Symp. Found. Comput. Sci., 1993," pp. 412-421, [Comput. Complexity, to appear].
5. H. B. Enderton, "A Mathematical Introduction to Logic," Academic Press, New York, 1972.
6. J. Friedman, A note on matrix rigidity, Combinatorica 13 (1993), 235-239.
7. F. Q. Gouvêa, "p-adic Numbers, An Introduction," Universitext, Springer-Verlag, New York/Berlin, 1993.
8. J. Håstad, Some optimal inapproximability results, in "Proc. Twenty-ninth Ann. ACM Symp. Theor. Comput., 1997," pp. 1-10.
9. C. Hespel, Approximation de séries formelles par des séries rationnelles, RAIRO Inform. Théor. 18 (1984), 241-258.
10. T. W. Hungerford, "Algebra," Graduate Text in Mathematics, Vol.73, Springer-Verlag, New York/ Berlin, 1987.
11. D. Ierardi, Quantifier elimination in the theory of an algebraically-closed field, in "Proc. Twenty-first Ann. ACM Symp. Theor. Comput., 1989," pp. 138-147.
12. P. Koiran, Hilbert's nullstellensatz is in the polynomial hierarchy, J. Complexity 12 (1996), 273-286.
13. S. Lang, "Algebra," Addison-Wesley, Reading, MA, 1971.
14. S. V. Lokam, Spectral methods for matrix rigidity with applications to size-depth tradeoffs and communication complexity, in "Proc. 36th Ann. Symp. Found. Comput. Sci., 1995," pp. 6-16, 1995.
15. Y. V. Matiyasevich, "Hilbert's Tenth Problem," The MIT Press, Cambridge, MA, 1993.
16. C. H. Papadimitriou and M. Yannakakis, Optimization, approximation, and complexity classes, J. Comput. System Sci. 43 (1991), 425-440.
17. J. Renegar, On the computational complexity and geometry of the first-order theory of the reals, part 1: Introduction, preliminaries. the geometry of semi-algebraic sets. the decision problem for the existential theory of the reals, J. Symbolic Comput. 13 (1992), 255-299.
18. J. T. Schwartz, Fast probabilistic algorithms for verification of polynomial identities, J. Assoc. Comput. Mach. 27 (1980), 701-717.
19. J. O. Shallit, On approximation by rational series in noncommuting variables, unpublished manuscript.
20. L. Valiant, Graph-theoretic arguments in low-level complexity, in "6th Mathematical Foundations of Computer Science," Lecture Notes in Computer Science, Vol.197, pp. 162-176, Springer-Verlag, New York/Berlin, 1977.
21. L. G. Valiant, Completeness classes in algebra, in "Proc. Eleventh Ann. ACM Symp. Theor. Comput., 1979," pp. 249-261.
22. N. Cohen, C. R. Johnson, L. Rodman, and H. Woerdeman, Ranks of completions of partial matrices, The Gohberg anniversary collection, Vol.I (Calgary, AB, 1988), pp. 165-185, Oper. Theory: Adv. Appl., Vol. 40, Birkhäuser, Basel, 1989.
23. N. Cohen, C. R. Johnson, L. Rodman, and H. Woerdeman, Ranks of completions of partial matrices, The Gohberg anniversary collection, Vol.I (Calgary, AB, 1988), pp. 165-185, Oper. Theory: Adv. Appl., Vol. 40, Birkhäuser, Basel, 1989.
24. P. J. Cohen, Decision procedures for real and p-adic fields, Comm. Pure Appl. Math. 22 (1969), 131-151.
25. J. Edmonds, Submodular functions, matroids and certain polyhedra, in "Combinatorial Structures and Their Applications" (R. Guy et al., Eds.), pp. 69-87, Gordon & Breach, New York, 1970.
26. J. Edmonds, Systems of distinct representatives and linear algebra, J. Res. Nat. Bur. Standards B 71 (1967), 241-245.
27. L. Egidi, A quantifier elimination for the theory of p-adic numbers, Comput. Complexity 7 (1998), 205-263.
28. J. F. Geelen, Maximum rank matrix completion, Linear Algebra Appl. 288 (1999), 211-217.
29. D. J. Hartfiel and R. Loewy, A determinantal version of the Frobenius-König theorem, Linear Multilinear Algebra 16 (1984), 155-166.
30. M. Laurent, Matrix completion problems, in "Encyclopedia of Optimization" (C. A. Floudas and P. M. Pardalos, Eds.), Kluwer, Dordrecht, to appear.
31. L. Lovász, On determinants, matchings, and random algorithms, in "Fundamentals of Computation Theory, FCT '79" (L. Budach, Ed.), pp. 565-574, Akademie-Verlag, Berlin, 1979.
32. K. Murota, Mixed matrices: Irreducibility and decomposition, in "Combinatorial and Graph-Theoretical Problems in Linear Algebra" (R. A. Brunaldi, S. Friedland, and V. Klee, Eds.), pp. 39-71, Springer-Verlag, New York, 1993.
33. H. J. Woerdeman, "Matrix and Operator Extensions," CWI Tract 68, Centrum voor Wiskunde en Informatica, Amsterdam, 1989.