The complexity of matrix completion

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn , Issue , 2006, Pages 1103-1111

  Harvey, Nicholas J A ^a   Karger, David R ^a   Yekhanin, Sergey ^a  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMIC APPLICATIONS; GREEDY ALGORITHM; NETWORK CODING; SYMBOLIC VARIABLES;

ALGORITHMS; COMPUTATIONAL COMPLEXITY; PROBLEM SOLVING;

MATRIX ALGEBRA;

EID: 33244464787     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1109557.1109679     Document Type: Conference Paper

References (29)

1. A. V. Aho, J. E. Hopcroft, and J. D. Ullman. The Design and Analysis of Computer Algorithms. Addison-Wesley, 1974.
2. M. Berdan. A matrix rank problem. Master's thesis, University of Waterloo, Dec. 2003.
3. J. A. Bondy and U. S. R. Murty. Graph Theory with Applications. Elsevier Science, 1976.
4. J. F. Buss, G. S. Frandsen, and J. O. Shallit. The computational complexity of some problems in linear algebra. Journal of Computer and System Sciences, 58(3):572-596, 1999.
5. D. Coppersmith and S. Winograd. Matrix multiplication via arithmetic progressions. Journal of Symbolic Computation, 9(3):251-280, 1990.
6. J. Edmonds. Systems of distinct representatives and linear algebra. Journal of Research of the National Bureau of Standards, 716:241-245, 1967.
7. J. F. Geelen. Maximum rank matrix completion. Linear Algebra and its Applications, 288:211-217, 1999.
8. J. F. Geelen. An algebraic matching algorithm. Combinatorica, 20(1):61-70, 2000.
9. J. F. Geelen. Matching theory. Lecture notes from the Euler Institute for Discrete Mathematics and its Applications, 2001.
10. J. F. Geelen and S. Iwata. Matroid matching via mixed skew-symmetric matrices. Combinatorica, 25(2):187-215, 2005.
11. J. F. Geelen, S. Iwata, and K. Murota. The linear delta-matroid parity problem. Journal of Combinatorial Theory, Series B, 88(2):377-398, 2003.
12. L. Gurvits. On the complexity of mixed discriminants and related problems. In Proceedings of the 30th International Symposium on Mathematical Foundations of Computer Science (MFCS), pages 447-458, Aug. 2005.
13. N. J. A. Harvey, D. R. Karger, and K. Murota. Deterministic network coding by matrix completion. In Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 05), pages 489-498, 2005.
14. T. Ho, D. R. Karger, M. Médard, and R. Koetter. Network coding from a network flow perspective. In Proceedings of the IEEE International Symposium on Information Theory (ISIT), June 2003.
15. S. Jaggi, P. Sanders, P. A. Chou, M. Effros, S. Egner, K. Jain, and L. Tolhuizen. Polynomial time algorithms for multicast network code construction. IEEE Transactions on Information Theory, 51(6):1973-1982, June 2005.
16. V. Kabanets and R. Impagliazzo. Derandomizing polynomial identity tests means proving circuit lower bounds. In Proceedings of the 35th Annual ACM Symposium on Theory of Computation (STOC), pages 355-364, June 2003.
17. R. Koetter and M. Médard. An algebraic approach to network coding. IEEE/ACM Transactions on Networking, 11(5):782-795, 2003.
18. M. Laurent. Matrix completion problems. In C. Floudas and P. Pardalos, editors, The Encyclopedia of Optimization, volume III, pages 221-229. Kluwer, 2001.
19. A. R. Lehman and E. Lehman. Complexity classification of network information flow problems. In Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 04), pages 135-143, Jan. 2004.
20. L. Lovász. On determinants, matchings and random algorithms. In L. Budach, editor, Fundamentals of Computation Theory, FCT '79, pages 565-574. Akademie-Verlag, Berlin, 1979.
21. L. Lovász. Singular spaces of matrices and their applications in combinatorics. Bol. Soc. Braz. Mat, 20:87-99, 1989.
22. M. Mucha and P. Sankowski. Maximum matchings via Gaussian elimination. In Proceedings of the 45th Annual IEEE Symposium on Foundations of Computer Science (FOCS), pages 248-255, Oct. 2004.
23. K. Mulmuley, U. V. Vazirani, and V. V. Vazirani. Matching is as easy as matrix inversion. Combinatorica, 7(1):105-113, 1987.
24. K. Murota. Mixed matrices -irreducibility and decomposition. In R. A. Brualdi, S. Priedland, and V. Klee, editors, Combinatorial and Graph-Theoretic Problems in Linear Algebra, volume 50 of IMA Volumes in Mathematics and its Applications, pages 39-71. Springer-Verlag, 1993.
25. K. Murota. Matrices and Matroids for Systems Analysis. Springer-Verlag, 2000.
26. T. G. Room. The Geometry of Determinantal Loci. Cambridge University Press, 1938.
27. P. Sankowski. Dynamic transitive closure via dynamic matrix inverse. In Proceedings of the 45th Annual IEEE Symposium on Foundations of Computer Science (FOCS), pages 509-517, Oct. 2004.
28. C. A. Tovey. A simplified NP-complete satisfiability problem. Discrete Applied Mathematics, 8(1):85-89, 1984.
29. L. G. Valiant. Completeness classes in algebra. In Proceedings of the 11th Annual ACM Symposium on Theory of Computation (STOC), pages 249-261, Apr. 1979.