Abstract
In this paper we consider the computational complexity of some problems dealing with matrix rank. Let E, S be subsets of a commutative ring R. Let x 1, x 2, ..., x t be variables. Given a matrix M= M(x 1, x 2, ..., x t ) with entries chosen from E ∪ {x 1, x 2, ..., x t }, we want to determine
and
There are also variants of these problems that specify more about the structure of M, or instead of asking for the minimum or maximum rank, ask if there is some substitution of the variables that makes the matrix invertible or noninvertible.
Depending on E, S, and on which variant is studied, the complexity of these problems can range from polynomial-time solvable to random polynomial-time solvable to NP-complete to PSPACE-solvable to unsolvable.
Supported in part by grants from NSERC Canada.
Supported in part by the ESPRIT Long Term Research Programme of the EU under project number 20244 (ALCOM-IT) and by BRICS, Basic Research in Computer Science, Centre of the Danish National Research Foundation.
Preview
Unable to display preview. Download preview PDF.
References
M. Bellare, O. Goldreich, and M. Sudan. Free bits, PCPs and non-approximability — towards tight results (3rd revision). Report Series 1995, Revision 02 of ECCC TR95-024, Electronic Colloqium on Computational Complexity, http://www.eccc.uni-trier.de/eccc/, December 1995. Earlier results appeared in Proc. 36th Ann. Symp. Found. Comput. Sci. (1995), 422–431.
J. Canny. Some algebraic and geometric computations in PSPACE. In Proc. Twentieth ACM Symp. Theor. Comput, pp. 460–467, 1988.
L. Egidi. The complexity of the theory of p-adic numbers. In Proc. 34th Ann. Symp. Found. Comput. Sci., pp. 412–421, 1993.
H. B. Enderton. A Mathematical Introduction to Logic. Academic Press, 1972.
J. Friedman. A note on matrix rigidity. Combinatorica 13 (1993), 235–239.
C. Hespel. Approximation de séries formelles par des séries rationnelles. RAIRO Inform. Théor. 18 (1984), 241–258.
D. Ierardi. Quantifier elimination in the theory of an algebraically-closed field. In Proc. Twenty-first Ann. ACM Symp. Theor. Comput., pp. 138–147, 1989.
S. Lang. Algebra. Addison-Wesley, 1971.
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., pp. 6–16, 1995.
Y. V. Matiyasevich. Hilbert's Tenth Problem. The MIT Press, 1993.
J. Renegar. On the computational complexity and geometry of the first-order theory of the reals. part I: 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.
J. T. Schwartz. Fast probabilistic algorithms for verification of polynomial identities. J. Assoc. Comput. Mach. 27 (1980), 701–717.
J. O. Shallit. On approximation by rational series in noncommuting variables. Unpublished manuscript, in preparation, 1996.
L. Valiant. Graph-theoretic arguments in low-level complexity. In 6th Mathematical Foundations of Computer Science, Vol. 197 of Lecture Notes in Computer Science, pp. 162–176. Springer-Verlag, 1977.
L. G. Valiant. Completeness classes in algebra. In Proc. Eleventh Ann. ACM Symp. Theor. Comput., pp. 249–261, 1979.
Author information
Authors and Affiliations
Corresponding authors
Editor information
Rights and permissions
Copyright information
© 1997 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Buss, J.F., Frandsen, G.S., Shallit, J.O. (1997). The computational complexity of some problems of linear algebra. In: Reischuk, R., Morvan, M. (eds) STACS 97. STACS 1997. Lecture Notes in Computer Science, vol 1200. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0023480
Download citation
DOI: https://doi.org/10.1007/BFb0023480
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-62616-9
Online ISBN: 978-3-540-68342-1
eBook Packages: Springer Book Archive