Computing the Maximum Degree of Minors in Mixed Polynomial Matrices via Combinatorial Relaxation
暂无分享,去创建一个
[1] Satoru Iwata,et al. Computing the Maximum Degree of Minors in Matrix Pencils via Combinatorial Relaxation , 1999, SODA '99.
[2] Satoru Iwata,et al. On the Kronecker Canonical Form of Mixed Matrix Pencils , 2011, SIAM J. Matrix Anal. Appl..
[3] Kazuo Murota,et al. Combinatorial relaxation algorithm for the maximum degree of subdeterminants: Computing Smith-Mcmillan form at infinity and structural indices in Kronecker form , 1995, Applicable Algebra in Engineering, Communication and Computing.
[4] Kazuo Murota,et al. On the Degree of Mixed Polynomial Matrices , 1998, SIAM J. Matrix Anal. Appl..
[5] James S. Thorp,et al. The singular pencil of a linear dynamical system , 1973 .
[6] Kazuo Murota,et al. Computing Puiseux-Series Solutions to Determinantal Equations via Combinatorial Relaxation , 1990, SIAM J. Comput..
[7] K. Murota. Systems Analysis by Graphs and Matroids: Structural Solvability and Controllability , 1987 .
[8] Erich Kaltofen,et al. On fast multiplication of polynomials over arbitrary algebras , 1991, Acta Informatica.
[9] Kazuo Murota,et al. Valuated Matroid Intersection II: Algorithms , 1996, SIAM J. Discret. Math..
[10] A. Storjohann. Algorithms for matrix canonical forms , 2000 .
[11] L. Mirsky,et al. The Theory of Matrices , 1961, The Mathematical Gazette.
[12] Thomas Kailath,et al. Rational matrix structure , 1979, 1979 18th IEEE Conference on Decision and Control including the Symposium on Adaptive Processes.
[13] 室田 一雄,et al. Primal-Dual Combinatorial Relaxation Algorithms for the Maximum Degree of Subdeterminants , 1995 .
[14] Kazuo Murota,et al. Valuated Matroid Intersection I: Optimality Criteria , 1996, SIAM J. Discret. Math..
[15] E. Bareiss. Sylvester’s identity and multistep integer-preserving Gaussian elimination , 1968 .
[16] Nicholas J. A. Harvey. Algebraic Algorithms for Matching and Matroid Problems , 2009, SIAM J. Comput..
[17] Ying Xu,et al. Efficient Theoretic and Practical Algorithms for Linear Matroid Intersection Problems , 1996, J. Comput. Syst. Sci..
[18] Piotr Sankowski,et al. Maximum matchings via Gaussian elimination , 2004, 45th Annual IEEE Symposium on Foundations of Computer Science.
[19] Piotr Sankowski,et al. Maximum weight bipartite matching in matrix multiplication time , 2009, Theor. Comput. Sci..
[20] Erwin H. Bareiss,et al. Computational Solutions of Matrix Problems Over an Integral Domain , 1972 .
[21] Satoru Iwata,et al. Combinatorial relaxation algorithm for mixed polynomial matrices , 2001, Math. Program..
[22] Kazuo Murota,et al. Computing the Degree of Determinants Via Combinatorial Relaxation , 1995, SIAM J. Comput..
[23] M. Iri,et al. Structural solvability of systems of equations —A mathematical formulation for distinguishing accurate and inaccurate numbers in structural analysis of systems— , 1985 .
[24] Peter Lancaster,et al. The theory of matrices , 1969 .
[25] James Demmel,et al. Accurate solutions of ill-posed problems in control theory , 1988 .
[26] Piotr Sankowski,et al. Maximum matchings in planar graphs via gaussian elimination , 2004, Algorithmica.
[27] Kazuo Murota,et al. Matrices and Matroids for Systems Analysis , 2000 .
[28] Kazuo Murota,et al. Systems Analysis by Graphs and Matroids , 1987 .