The complexity of matrix rank and feasible systems of linear equations

10Citations
Citations of this article
16Readers
Mendeley users who have this article in their library.

Abstract

We characterize the complexity of some natural and important problems in linear algebra. In particular, we identify natural complexity classes for which the problems of (a) determining if a system of linear equations is feasible and (b) computing the rank of an integer matrix, (as well as other problems), are complete under logspace reductions. As an important part of presenting this classification, we show that the "exact counting logspace hierarchy" collapses to near the bottom level. (We review the definition of this hierarchy below.) We further show that this class is closed under NC1-reducibihty, and that it consists of exactly those languages that have logspace uniform span programs (introduced by Karchmer and Wigderson) over the rationals. In addition, we contrast the complexity of these problems with the complexity of determining if a system of linear equations has an integer solution.

References Powered by Scopus

Parity, circuits, and the polynomial-time hierarchy

653Citations
N/AReaders
Get full text

A taxonomy of problems with fast parallel algorithms

438Citations
N/AReaders
Get full text

Nondeterministic space is closed under complementation

415Citations
N/AReaders
Get full text

Cited by Powered by Scopus

Making nondeterminism unambiguous

74Citations
N/AReaders
Get full text

Superpolynomial lower bounds for monotone span programs

64Citations
N/AReaders
Get full text

On TC<sup>0</sup>, AC<sup>0</sup>, and arithmetic circuits

40Citations
N/AReaders
Get full text

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Cite

CITATION STYLE

APA

Allender, E., Beals, R., & Ogihara, M. (1996). The complexity of matrix rank and feasible systems of linear equations. In Proceedings of the Annual ACM Symposium on Theory of Computing (Vol. Part F129452, pp. 161–167). Association for Computing Machinery. https://doi.org/10.1145/237814.237856

Readers over time

‘13‘15‘16‘17‘18‘19‘20‘21‘2301234

Readers' Seniority

Tooltip

PhD / Post grad / Masters / Doc 9

64%

Professor / Associate Prof. 2

14%

Researcher 2

14%

Lecturer / Post doc 1

7%

Readers' Discipline

Tooltip

Computer Science 13

93%

Physics and Astronomy 1

7%

Save time finding and organizing research with Mendeley

Sign up for free
0