The complexity of matrix rank and feasible systems of linear equations (extended abstract)

Conference proceeding

Proceedings of the twenty-eighth annual ACM symposium on theory of computing, Vol.129452, pp.161-167

STOC '96

07/01/1996

Metrics

16 Record Views

Title: The complexity of matrix rank and feasible systems of linear equations (extended abstract)
Creators: Eric Allender
Robert Beals
Mitsunori Ogihara
Publication Details: Proceedings of the twenty-eighth annual ACM symposium on theory of computing, Vol.129452, pp.161-167
Date published: 07/01/1996
Series: STOC '96
Publisher: ACM
Academic Unit: Computer Science (SAS); Mathematics (SAS); Advising and Academic Services (SAS)
Language: English
Resource Type: Conference proceeding
Identifiers: 991031654465304646