Pages that link to "Item:Q1776342"
From MaRDI portal
The following pages link to Solving polynomial equations. Foundations, algorithms, and applications (Q1776342):
Displayed 13 items.
- Single-lifting Macaulay-type formulae of generalized unmixed sparse resultants (Q548599) (← links)
- Exact algorithms for the bottleneck Steiner tree problem (Q652535) (← links)
- Finding all Nash equilibria of a finite game using polynomial algebra (Q847806) (← links)
- A prolongation-projection algorithm for computing the finite real variety of an ideal (Q1029340) (← links)
- Semidefinite characterization and computation of zero-dimensional real radical ideals (Q1029543) (← links)
- Real polynomial iterative roots in the case of nonmonotonicity height \(\geqslant 2\) (Q1934386) (← links)
- Optimized parametrization of systems of incidences between rigid bodies (Q2269698) (← links)
- Parallelization of modular algorithms (Q2430024) (← links)
- From an approximate to an exact absolute polynomial factorization (Q2457357) (← links)
- Nonnegative polynomials and sums of squares (Q2892812) (← links)
- Computation with Polynomial Equations and Inequalities Arising in Combinatorial Optimization (Q2897307) (← links)
- Algebraic algorithms for structure determination in biological chemistry (Q3566850) (← links)
- On computing absolutely irreducible components of algebraic varieties with parameters (Q5962004) (← links)