Cited in
(only showing first 100 items - show all)- Chordal networks of polynomial ideals
- Univariate Polynomial Real Root Isolation: Continued Fractions Revisited
- A deterministic algorithm for isolating real roots of a real polynomial
- A comparative study of two real root isolation methods
- A general approach to isolating roots of a bitstream polynomial
- A unified approach to computing real and complex zeros of zero-dimensional ideals
- Effective coefficient asymptotics of multivariate rational functions via semi-numerical algorithms for polynomial systems
- Intersection theory in differential algebraic geometry: generic intersections and the differential Chow form
- Logcf: an efficient tool for real root isolation
- Solving determinantal systems using homotopy techniques
- A parametric representation of totally mixed Nash equilibria
- Solutions of polynomial systems derived from the steady cavity flow problem (extended abstract).
- Effective algorithm for computing Noetherian operators of zero-dimensional ideals
- Automated Deduction in Geometry
- A survey on the complexity of solving algebraic systems
- Symbolic computation in hyperbolic programming
- A concise proof of the Kronecker polynomial system solver from scratch
- A symbolic-numerical algorithm for isolating real roots of certain radical expressions
- Multiplicities of tensor eigenvalues
- \texttt{PTOPO}: computing the geometry and the topology of parametric curves
- Parallel computation of real solving bivariate polynomial systems by zero-matching method
- Multilinear polynomial systems: root isolation and bit complexity
- Revisiting the problem of zeros of univariate scalar Béziers
- Computing and using minimal polynomials
- A quadratic clipping step with superquadratic convergence for bivariate polynomial systems
- Sparse FGLM algorithms
- A rational cubic clipping method for computing real roots of a polynomial
- How to count the number of zeros that a polynomial has on the unit circle?
- A softly optimal Monte Carlo algorithm for solving bivariate polynomial systems over the integers
- Computation of dominant real roots of polynomials
- Effective computational geometry for curves and surfaces
- Real Schubert Calculus: Polynomial Systems and a Conjecture of Shapiro and Shapiro
- Real solution isolation with multiplicity of zero-dimensional triangular systems
- Real root isolation of regular chains
- Solving bivariate systems using rational univariate representations
- Computing the eigenvalue in the Schoof-Elkies-Atkin algorithm using abelian lifts
- Complexity results for triangular sets
- Modular composition modulo triangular sets and applications
- Linear and quadratic complexity bounds on the values of the positive roots of polynomials
- Genus 2 point counting over prime fields
- Fast arithmetics in Artin-Schreier towers over finite fields
- Root isolation of zero-dimensional polynomial systems with linear univariate representation
- Certified non-conservative tests for the structural stability of discrete multidimensional systems
- Deterministic normal position transformation and its applications
- Algebraic approaches to stability analysis of biological systems
- Solving parametric systems of polynomial equations over the reals through Hermite matrices
- Computing polynomial univariate representations of zero-dimensional ideals by Gröbner basis
- Efficient inversion of rational maps over finite fields
- Continuous amortization and extensions: with applications to bisection-based root isolation
- Bit complexity for computing one point in each connected component of a smooth real algebraic set
- Resolvent representation for regular differential ideals
- Root isolation for bivariate polynomial systems with local generic position method
- A simplified rational representation for positive-dimensional polynomial systems and SHEPWM equations solving
- Motivations for an arbitrary precision interval arithmetic and the MPFI library
- A baby steps/giant steps probabilistic algorithm for computing roadmaps in smooth bounded real hypersurface
- Exact, efficient, and complete arrangement computation for cubic curves
- Intersecting quadrics: an efficient and exact implementation
- Bit-size estimates for triangular sets in positive dimension
- Approximate radical for clusters: A global approach using Gaussian elimination or SVD
- Computing PUR of zero-dimensional ideals of breadth at most one
- Solving rank-constrained semidefinite programs in exact arithmetic
- Blind algebraic identification of communication channels: symbolic solution algorithms
- Isolating the real roots of the piecewise algebraic variety
- Real Algebraic Numbers: Complexity Analysis and Experimentation
- A near-optimal subdivision algorithm for complex root isolation based on the Pellet test and Newton iteration
- Topics in computational algebraic number theory
- Complexity, exactness, and rationality in polynomial optimization
- Fast and exact geometric analysis of real algebraic plane curves
- Fast approach for computing roots of polynomials using cubic clipping
- Trees and jumps and real roots.
- FLQ, the fastest quadratic complexity bound on the values of positive roots of polynomials
- A Gröbner free alternative for polynomial system solving
- On the computing time of the continued fractions method
- Determination of the limits for multivariate rational functions
- A new algorithm for computing certified numerical approximations of the roots of a zero-dimensional system
- On the asymptotic and practical complexity of solving bivariate systems over the reals
- On the complexity of isolating real roots and computing with certainty the topological degree
- Complete numerical isolation of real roots in zero-dimensional triangular systems
- Certifying solutions to overdetermined and singular polynomial systems over \(\mathbb{Q}\)
- Characterizations of solutions in geochemistry: existence, uniqueness, and precipitation diagram
- Automated Deduction in Geometry
- A new method for real root isolation of univariate polynomials
- Introduction to the solution of polynomial systems
- Solving zero-dimensional systems through the rational univariate representation
- Properness defects and projections and computation of at least one point in each connected component of a real algebraic set
- Near optimal subdivision algorithms for real root isolation
- Symbolic-numeric methods for solving polynomial equations and applications
- Semidefinite characterization and computation of zero-dimensional real radical ideals
- Probabilistic algorithms for computing resolvent representations of regular differential ideals
- Isolating real roots of real polynomials
- Polynomial equation solving by lifting procedures for ramified fibers
- Bit complexity for multi-homogeneous polynomial system solving -- application to polynomial minimization
- scientific article; zbMATH DE number 1795740 (Why is no real title available?)
- Real Root Isolation of Polynomial Equations Based on Hybrid Computation
- Moments, positive polynomials and their applications
- On the time-space complexity of geometric elimination procedures
- Numerical Software with Result Verification
- Computing critical points for invariant algebraic systems
- The first rational Chebyshev knots
- Software for the Gale transform of fewnomial systems and a Descartes rule for fewnomials
This page was built for software: ISOLATE
