The following pages link to ISOLATE (Q19758):
Displaying 50 items.
- A softly optimal Monte Carlo algorithm for solving bivariate polynomial systems over the integers (Q272196) (← links)
- Continuous amortization and extensions: with applications to bisection-based root isolation (Q277222) (← links)
- Multiplicities of tensor eigenvalues (Q305077) (← links)
- Software for the Gale transform of fewnomial systems and a Descartes rule for fewnomials (Q312198) (← links)
- Solving bivariate systems using rational univariate representations (Q325154) (← links)
- On polynomial feedback Nash equilibria for two-player scalar differential games (Q340618) (← links)
- A certified numerical algorithm for the topology of resultant and discriminant curves (Q346543) (← links)
- An efficient algorithm for factoring polynomials over algebraic extension field (Q365855) (← links)
- Modular composition modulo triangular sets and applications (Q371190) (← links)
- Improved bounds for the CF algorithm (Q385006) (← links)
- Exact symbolic-numeric computation of planar algebraic curves (Q387800) (← links)
- Genus 2 point counting over prime fields (Q412199) (← links)
- Fast arithmetics in Artin-Schreier towers over finite fields (Q420745) (← links)
- Root isolation of zero-dimensional polynomial systems with linear univariate representation (Q420751) (← links)
- On the computing time of the continued fractions method (Q438690) (← links)
- Design of Marx generators as a structured eigenvalue assignment (Q472612) (← links)
- Separating linear forms and rational univariate representations of bivariate systems (Q480646) (← links)
- A generic position based method for real root isolation of zero-dimensional polynomial systems (Q480656) (← links)
- Relaxed Hensel lifting of triangular sets (Q480691) (← links)
- Root refinement for real polynomials using quadratic interval refinement (Q484890) (← links)
- Computing real roots of real polynomials (Q491245) (← links)
- Solving a sparse system using linear algebra (Q491257) (← links)
- On the maximum computing time of the bisection method for real root isolation (Q507151) (← links)
- Bound the number of limit cycles bifurcating from center of polynomial Hamiltonian system via interval analysis (Q508217) (← links)
- Multiple point compression on elliptic curves (Q521859) (← links)
- Real solution isolation with multiplicity of zero-dimensional triangular systems (Q543162) (← links)
- Topics in computational algebraic number theory (Q558179) (← links)
- Gröbner bases and wavelet design (Q597059) (← links)
- Polynomial equation solving by lifting procedures for ramified fibers (Q598210) (← links)
- The first rational Chebyshev knots (Q607058) (← links)
- A deterministic algorithm for isolating real roots of a real polynomial (Q607163) (← links)
- On the determination of cusp points of 3-RPR parallel manipulators (Q612672) (← links)
- Fast approach for computing roots of polynomials using cubic clipping (Q625270) (← links)
- On the topology of real algebraic plane curves (Q626980) (← links)
- Computing minimum distance between two implicit algebraic surfaces (Q628165) (← links)
- An algorithm for addressing the real interval eigenvalue problem (Q629549) (← links)
- A baby steps/giant steps probabilistic algorithm for computing roadmaps in smooth bounded real hypersurface (Q629823) (← links)
- Efficient and accurate computation of upper bounds of approximation errors (Q633637) (← links)
- Exact algorithms for the bottleneck Steiner tree problem (Q652535) (← links)
- On the computation of matrices of traces and radicals of ideals (Q654040) (← links)
- A general approach to isolating roots of a bitstream polynomial (Q655157) (← links)
- SqFreeEVAL: An (almost) optimal real-root isolation algorithm (Q655566) (← links)
- Bit-size estimates for triangular sets in positive dimension (Q657656) (← links)
- Khovanskii-Rolle continuation for real solutions (Q660674) (← links)
- Pivoting in extended rings for computing approximate Gröbner bases (Q691644) (← links)
- A quadratic clipping step with superquadratic convergence for bivariate polynomial systems (Q691650) (← links)
- On the complexity of isolating real roots and computing with certainty the topological degree (Q700184) (← links)
- Properness defects and projections and computation of at least one point in each connected component of a real algebraic set (Q705131) (← links)
- On the computation of an arrangement of quadrics in 3D (Q705551) (← links)
- Certified approximation of parametric space curves with cubic \(B\)-spline curves (Q714496) (← links)
