A hybrid algorithm for multi-homogeneous Bézout number
暂无分享,去创建一个
[1] Alexander I. Barvinok,et al. Two Algorithmic Results for the Traveling Salesman Problem , 1996, Math. Oper. Res..
[2] Xiaoyan Liu,et al. Random path method with pivoting for computing permanents of matrices , 2007, Appl. Math. Comput..
[3] Leslie G. Valiant,et al. The Complexity of Computing the Permanent , 1979, Theor. Comput. Sci..
[4] A. Morgan,et al. Errata: Computing all solutions to polynomial systems using homotopy continuation , 1987 .
[5] Leyuan Shi,et al. Computing the optimal partition of variables in multi-homogeneous homotopy methods , 2005, Appl. Math. Comput..
[6] Richard J. Lipton,et al. A Monte-Carlo Algorithm for Estimating the Permanent , 1993, SIAM J. Comput..
[7] Tiejun Li,et al. Minimizing multi-homogeneous Bézout numbers by a local search method , 2001, Math. Comput..
[8] Xiaoyan Liu,et al. Optimization problem in multi-homogeneous homotopy method , 2004, Optim. Methods Softw..
[9] A. Morgan,et al. A homotopy for solving general polynomial systems that respects m-homogeneous structures , 1987 .
[10] Albert Nijenhuis,et al. Combinatorial Algorithms for Computers and Calculators , 1978 .
[11] H. E. Slaught. THE CARUS MATHEMATICAL MONOGRAPHS , 1923 .
[12] Charles W. Wampler. Bezout number calculations for multi-homogeneous polynomial systems , 1992 .
[13] Fengshan Bai,et al. Heuristic methods for computing the minimal multi-homogeneous Bézout number , 2003, Appl. Math. Comput..
[14] C. B. García,et al. Finding all solutions to polynomial systems and other systems of equations , 1979, Math. Program..