Pages that link to "Item:Q1293968"
From MaRDI portal
The following pages link to Solving zero-dimensional systems through the rational univariate representation (Q1293968):
Displaying 50 items.
- A softly optimal Monte Carlo algorithm for solving bivariate polynomial systems over the integers (Q272196) (← 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)
- Modular composition modulo triangular sets and applications (Q371190) (← 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)
- 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)
- Multiple point compression on elliptic curves (Q521859) (← 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)
- On the determination of cusp points of 3-RPR parallel manipulators (Q612672) (← links)
- On the topology of real algebraic plane curves (Q626980) (← links)
- A baby steps/giant steps probabilistic algorithm for computing roadmaps in smooth bounded real hypersurface (Q629823) (← links)
- Exact algorithms for the bottleneck Steiner tree problem (Q652535) (← links)
- On the computation of matrices of traces and radicals of ideals (Q654040) (← 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 computation of an arrangement of quadrics in 3D (Q705551) (← links)
- HELP: a sparse error locator polynomial for BCH codes (Q780362) (← links)
- Certification for polynomial systems via square subsystems (Q820969) (← 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)
- Involutions of polynomially parametrized surfaces (Q893108) (← links)
- A generalization of Stickelberger's theorem (Q924361) (← 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)
- Solving zero-dimensional algebraic systems (Q1190743) (← links)
- A simplified rational representation for positive-dimensional polynomial systems and SHEPWM equations solving (Q1621120) (← 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)
- Improved algorithms for computing determinants and resultants (Q1763424) (← links)
- A modular method to compute the rational univariate representation of zero-dimensional ideals (Q1808670) (← links)
- Real solving for positive dimensional systems. (Q1867000) (← links)
- Complexity results for triangular sets (Q1878489) (← links)
