The following pages link to ISOLATE (Q19758):
Displayed 50 items.
- HELP: a sparse error locator polynomial for BCH codes (Q780362) (← links)
- Certification for polynomial systems via square subsystems (Q820969) (← links)
- Computation of dominant real roots of polynomials (Q840004) (← links)
- Moments and sums of squares for polynomial optimization and related problems (Q842714) (← links)
- Blind algebraic identification of communication channels: symbolic solution algorithms (Q857886) (← links)
- Effective computational geometry for curves and surfaces (Q859465) (← links)
- On multiple roots in Descartes' rule and their distance to roots of higher derivatives (Q859884) (← links)
- Introduction to the solution of polynomial systems (Q880210) (← links)
- Involutions of polynomially parametrized surfaces (Q893108) (← links)
- Algebraic approaches to stability analysis of biological systems (Q926326) (← links)
- Near-optimal parameterization of the intersection of quadrics. I. The generic algorithm (Q954969) (← links)
- On sign conditions over real multivariate polynomials (Q977180) (← links)
- A parametric representation of totally mixed Nash equilibria (Q979929) (← links)
- Probabilistic algorithms for computing resolvent representations of regular differential ideals (Q985372) (← links)
- Thirty years of polynomial system solving, and now? (Q1006651) (← links)
- Complete numerical isolation of real roots in zero-dimensional triangular systems (Q1025386) (← links)
- On the asymptotic and practical complexity of solving bivariate systems over the reals (Q1025391) (← 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)
- Isolating the real roots of the piecewise algebraic variety (Q1029844) (← links)
- Solving zero-dimensional systems through the rational univariate representation (Q1293968) (← links)
- Trees and jumps and real roots. (Q1421216) (← links)
- Fast algorithms for zero-dimensional polynomial systems using duality (Q1422204) (← links)
- Resolvent representation for regular differential ideals (Q1566397) (← links)
- Design, analysis, and implementation of a multiprecision polynomial rootfinder (Q1569736) (← links)
- A simplified rational representation for positive-dimensional polynomial systems and SHEPWM equations solving (Q1621120) (← links)
- A rational cubic clipping method for computing real roots of a polynomial (Q1632370) (← links)
- Revisiting the problem of zeros of univariate scalar Béziers (Q1632405) (← links)
- A near-optimal subdivision algorithm for complex root isolation based on the Pellet test and Newton iteration (Q1680157) (← links)
- Computing Chebyshev knot diagrams (Q1680160) (← links)
- Bit complexity for multi-homogeneous polynomial system solving -- application to polynomial minimization (Q1690788) (← links)
- Sparse FGLM algorithms (Q1711988) (← links)
- Univariate real root isolation in an extension field and applications (Q1757003) (← links)
- Improved algorithms for computing determinants and resultants (Q1763424) (← links)
- Solving polynomial equations. Foundations, algorithms, and applications (Q1776342) (← links)
- On the Bézout construction of the resultant (Q1808661) (← links)
- Real solving for positive dimensional systems. (Q1867000) (← links)
- Complexity results for triangular sets (Q1878489) (← links)
- On the complexity of computing with zero-dimensional triangular sets (Q1930161) (← links)
- Affine solution sets of sparse polynomial systems (Q1940920) (← links)
- Moment matrices, border bases and real radical computation (Q1940922) (← links)
- Homotopy techniques for solving sparse column support determinantal polynomial systems (Q1979422) (← links)
- New nonarithmetic complex hyperbolic lattices. II (Q1980008) (← links)
- Multilinear polynomial systems: root isolation and bit complexity (Q1994888) (← links)
- Certified non-conservative tests for the structural stability of discrete multidimensional systems (Q2002386) (← links)
- Deterministic normal position transformation and its applications (Q2006776) (← links)
- Solving the equality-constrained minimization problem of polynomial functions (Q2010089) (← links)
- Lexicographic Gröbner bases of bivariate polynomials modulo a univariate one (Q2066949) (← links)
- Bit complexity for computing one point in each connected component of a smooth real algebraic set (Q2100045) (← links)
- Computing critical points for invariant algebraic systems (Q2100065) (← links)