Dynamic matrix rank

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4051 LNCS, Issue , 2006, Pages 395-406

  Frandsen, Gudmund Skovbjerg ^a   Frandsen, Peter Frands ^b  

^a AALBORG UNIVERSITY   (Denmark)

^b RAMBOLL   (Denmark)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL METHODS; COMPUTER PROGRAMMING; DYNAMIC PROGRAMMING; FUNCTION EVALUATION; INFORMATION ANALYSIS; MATRIX ALGEBRA;

CLOSED FIELDS; DYNAMIC MATRIX RANK; MATRIX MULTIPLICATION; RATIONAL FUNCTIONS;

DIGITAL ARITHMETIC;

EID: 33746353705     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11786986_35     Document Type: Conference Paper

References (11)

1. Mark Berdan. A matrix rank problem. Master's thesis, University of Waterloo, December 2003.
2. Peter Bürgisser, Michael Clausen, and M. Amin Shokrollahi. Algebraic complexity theory, volume 315 of Grundlehren der Mathematischen Wissenschaften [Fundamental Principles of Mathematical Sciences]. Springer-Verlag, Berlin, 1997. With the collaboration of Thomas Lickteig.
3. Don Coppersmith and Shmuel Winograd. Matrix multiplication via arithmetic progressions. J. Symbolic Comput., 9(3):251-280, 1990.
4. Gudmund Skovbjerg Frandsen, Johan P. Hansen, and Peter Bro Miltersen. Lower bounds for dynamic algebraic problems. Inform. and Comput., 171(2):333-349, 2001.
5. James F. Geelen. Maximum rank matrix completion. Linear Algebra Appl., 288(1-3):211-217, 1999.
6. Nicholas J. A. Harvey, David R. Karger, and Kazuo Murota. Deterministic network coding by matrix completion. In SODA '05: Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms, pages 489-498, Philadelphia, PA, USA, 2005. Society for Industrial and Applied Mathematics.
7. Xiaohan Huang and Victor Y. Pan. Fast rectangular matrix multiplication and applications. J. Complexity, 14(2):257-299, 1998.
8. Walter Keller-Gehrig. Fast algorithms for the characteristic polynomial. Theoret. Comput. Sci., 36(2-3):309-317, 1985.
9. Piotr Sankowski. Dynamic transitive closure via dynamic matrix inverse (extended abstract). In FOCS '04: Proceedings of the 45th Annual IEEE Symposium on Foundations of Computer Science (FOCS'04), pages 509-517, Washington, DC, USA, 2004. IEEE Computer Society.
10. Piotr Sankowski. Faster dynamic matchings and vertex connectivity (extended abstract). April 2006.
11. A. Schönhage. Unitäre Transformationen grosser Matrizen. Numer. Math., 20:409-417, 1972/73.