Pages that link to "Item:Q1911937"

The following pages link to Efficient incremental algorithms for the sparse resultant and the mixed volume (Q1911937):

Displaying 47 items.

• Computing isolated roots of sparse polynomial systems in affine space (Q410703) (← links)
• Solving a sparse system using linear algebra (Q491257) (← links)
• Mixed cell computation in HOM4ps (Q507160) (← links)
• Relative Stanley-Reisner theory and upper bound theorems for Minkowski sums (Q507686) (← links)
• Finiteness of relative equilibria of the four-body problem (Q818632) (← links)
• Comparing acceleration techniques for the Dixon and Macaulay resultants (Q974251) (← links)
• An effective algorithm of computing symbolic determinants with multivariate polynomial entries (Q990537) (← links)
• A polynomial-time algorithm to approximate the mixed volume within a simply exponential factor (Q1016541) (← links)
• Deformation techniques for sparse systems (Q1029552) (← links)
• Mixed volume techniques for embeddings of Laman graphs (Q1037775) (← links)
• Techniques for exploiting structure in matrix formulae of the sparse resultant (Q1127958) (← links)
• Computing zeros of analytic mappings: A logarithmic residue approach (Q1272883) (← links)
• How to count efficiently all affine roots of a polynomial system (Q1289017) (← links)
• Toric intersection theory for affine root counting (Q1295703) (← links)
• Certified approximate univariate GCDs (Q1358910) (← links)
• Lower bounds for diophantine approximations (Q1358914) (← links)
• Polar varieties, real equation solving, and data structures: the hypersurface case (Q1361872) (← links)
• Numerical homotopies to compute generic points on positive dimensional algebraic sets (Q1594830) (← links)
• Symbolic and numeric methods for exploiting structure in constructing resultant matrices (Q1600039) (← links)
• Sparse resultant of composed polynomials. I: Mixed-unmixed case. (Q1600042) (← links)
• Enumerating a subset of the integer points inside a Minkowski sum (Q1602946) (← links)
• Computing mixed volume and all mixed cells in quermassintegral time (Q1683740) (← links)
• Elimination theory in differential and difference algebra (Q1730314) (← links)
• Improved algorithms for computing determinants and resultants (Q1763424) (← links)
• Matrices in elimination theory (Q1808659) (← links)
• Solving degenerate sparse polynomial systems faster (Q1808666) (← links)
• Some aspects of studying an optimization or decision problem in different computational models (Q1848391) (← links)
• Computing all nonsingular solutions of cyclic-\(n\) polynomial using polyhedral homotopy continuation methods (Q1872931) (← links)
• Multihomogeneous resultant formulae by means of complexes (Q1878475) (← links)
• New bounds and an efficient algorithm for sparse difference resultants (Q2029018) (← links)
• Elimination for generic sparse polynomial systems (Q2249474) (← links)
• Sparse differential resultant for Laurent differential polynomials (Q2351806) (← links)
• Generalized polar varieties: geometry and algorithms (Q2387411) (← links)
• Unmixing the mixed volume computation (Q2421592) (← links)
• Heuristics to accelerate the Dixon resultant (Q2483552) (← links)
• Rational univariate reduction via toric resultants (Q2517810) (← links)
• Constructing Sylvester-type resultant matrices using the Dixon formulation (Q2643539) (← links)
• Matrix Formulae of Differential Resultant for First Order Generic Ordinary Differential Polynomials (Q2799577) (← links)
• Exploiting Chordal Structure in Polynomial Ideals: A Gröbner Bases Approach (Q2818203) (← links)
• Pruning Algorithms for Pretropisms of Newton Polytopes (Q2830024) (← links)
• Explicit factors of some iterated resultants and discriminants (Q3055098) (← links)
• A Complete Implementation for Computing General Dimensional Convex Hulls (Q4513209) (← links)
• Mixed multiplicities of ideals versus mixed volumes of polytopes (Q5297029) (← links)
• (Q5389777) (← links)
• Sparse difference resultant (Q5891997) (← links)
• A systematic framework for solving geometric constraints analytically (Q5926297) (← links)
• Balancing the lifting values to improve the numerical stability of polyhedral homotopy continuation methods (Q5931634) (← links)