Computing Mixed Volume and All Mixed Cells in Quermassintegral Time
暂无分享,去创建一个
[1] Jan Verschelde,et al. Software for algebraic geometry , 2008 .
[2] Gregorio Malajovich,et al. On the Expected Number of Zeros of Nonlinear Equations , 2011, Found. Comput. Math..
[3] L. Khachiyan. COMMUNICATIONS OF THE MOSCOW MATHEMATICAL SOCIETY: The problem of calculating the volume of a polyhedron is enumerably hard , 1989 .
[4] Virginia Vassilevska Williams,et al. Multiplying matrices faster than coppersmith-winograd , 2012, STOC '12.
[5] Leonid Gurvits. A Polynomial-Time Algorithm to Approximate the Mixed Volume within a Simply Exponential Factor , 2009, Discret. Comput. Geom..
[6] Alexander I. Barvinok,et al. Computing Mixed Discriminants, Mixed Volumes, and Permanents , 1997, Discret. Comput. Geom..
[7] J. Verschelde,et al. Homotopies exploiting Newton polytopes for solving sparse polynomial systems , 1994 .
[8] François Le Gall,et al. Powers of tensors and fast matrix multiplication , 2014, ISSAC.
[9] Martin E. Dyer,et al. On the Complexity of Computing Mixed Volumes , 1998, SIAM J. Comput..
[10] Jan Verschelde,et al. Algorithm 795: PHCpack: a general-purpose solver for polynomial systems by homotopy continuation , 1999, TOMS.
[11] A. Morgan. Solving Polynomial Systems Using Continuation for Engineering and Scientific Problems , 1987 .
[12] Ioannis Z. Emiris,et al. Efficient Random-Walk Methods for Approximating Polytope Volume , 2014, Symposium on Computational Geometry.
[13] J. Canny,et al. Efficient Incremental Algorithms for the , 1994 .
[14] Tangan Gao,et al. Algorithm 846: MixedVol: a software package for mixed-volume computation , 2005, TOMS.
[15] Ioannis Z. Emiris,et al. On the Complexity of Sparse Elimination , 1996, J. Complex..
[16] Sam Payne,et al. Connectivity of tropicalizations , 2012, 1204.6589.
[17] D. N. Bernshtein. The number of roots of a system of equations , 1975 .
[18] Ronald Cools,et al. Mixed-volume computation by dynamic lifting applied to polynomial system solving , 1996, Discret. Comput. Geom..
[19] Akiko Takeda,et al. Dynamic Enumeration of All Mixed Cells , 2007, Discret. Comput. Geom..
[20] Akiko Takeda,et al. DEMiCs: A Software Package for Computing the Mixed Volume Via Dynamic Enumeration of all Mixed Cells , 2008 .
[21] Caroline Uhler,et al. Geometry of maximum likelihood estimation in Gaussian graphical models , 2010, 1012.2643.
[22] Ioannis Z. Emiris,et al. Root counts of semi-mixed systems, and an application to counting nash equilibria , 2014, ISSAC.
[23] Bernd Sturmfels,et al. A polyhedral method for solving sparse polynomial systems , 1995 .
[24] James Demmel,et al. Applied Numerical Linear Algebra , 1997 .
[25] Gregorio Malajovich,et al. High probability analysis of the condition number of sparse polynomial systems , 2004, Theor. Comput. Sci..
[26] David Thomas,et al. The Art in Computer Programming , 2001 .
[27] Tien Yien Li,et al. MIXED VOLUME COMPUTATION IN PARALLEL , 2014 .
[28] Xing Li,et al. Finding Mixed Cells in the Mixed Volume Computation , 2001, Found. Comput. Math..
[29] Tien Yien Li,et al. MIXED VOLUME COMPUTATION VIA LINEAR PROGRAMMING , 2000 .