Pages that link to "Item:Q5938584"
From MaRDI portal
The following pages link to A Gröbner free alternative for polynomial system solving (Q5938584):
Displaying 50 items.
- Real root finding for low rank linear matrices (Q2175227) (← links)
- Computing real radicals and \(S\)-radicals of polynomial systems (Q2200311) (← links)
- Effective coefficient asymptotics of multivariate rational functions via semi-numerical algorithms for polynomial systems (Q2211202) (← links)
- Solving determinantal systems using homotopy techniques (Q2229744) (← links)
- Exact algorithms for semidefinite programs with degenerate feasible set (Q2229751) (← links)
- Elimination for generic sparse polynomial systems (Q2249474) (← links)
- Intrinsic complexity estimates in polynomial optimization (Q2251913) (← links)
- Complexity of solving parametric polynomial systems (Q2256707) (← links)
- Fast multivariate multi-point evaluation revisited (Q2283121) (← links)
- On types of degenerate critical points of real polynomial functions (Q2284966) (← links)
- Counting points on hyperelliptic curves with explicit real multiplication in arbitrary genus (Q2303419) (← links)
- Accelerated tower arithmetic (Q2338646) (← links)
- Degeneracy loci and polynomial equation solving (Q2340506) (← links)
- On the complexity of the \(F_5\) Gröbner basis algorithm (Q2343240) (← links)
- Stable normal forms for polynomial system solving (Q2378497) (← links)
- Generalized polar varieties: geometry and algorithms (Q2387411) (← links)
- Numeric vs. symbolic homotopy algorithms in polynomial system solving: a case study (Q2387419) (← links)
- Certifying solutions to overdetermined and singular polynomial systems over \(\mathbb{Q}\) (Q2399868) (← links)
- Multistationarity in structured reaction networks (Q2417526) (← links)
- Improved complexity bounds for counting points on hyperelliptic curves (Q2420634) (← links)
- A concise proof of the Kronecker polynomial system solver from scratch (Q2427141) (← links)
- Change of order for regular chains in positive dimension (Q2476011) (← links)
- On the complexity of the resolvent representation of some prime differential ideals (Q2496182) (← links)
- Rational univariate reduction via toric resultants (Q2517810) (← links)
- A probabilistic algorithm for computing data-discriminants of likelihood equations (Q2628325) (← links)
- On the complexity exponent of polynomial system solving (Q2658549) (← links)
- Positive dimensional parametric polynomial systems, connectivity queries and applications in robotics (Q2674013) (← links)
- Weak identifiability for differential algebraic systems (Q2701024) (← links)
- Puiseux Expansions and Nonisolated Points in Algebraic Varieties (Q2813651) (← links)
- Exact Algorithms for Linear Matrix Inequalities (Q2834563) (← links)
- AN APPLICATION OF REGULAR CHAIN THEORY TO THE STUDY OF LIMIT CYCLES (Q2866055) (← links)
- Point searching in real singularcomplete intersection varieties: algorithms of intrinsic complexity (Q2871188) (← links)
- Fast computation of a rational point of a variety over a finite field (Q3420246) (← links)
- Numerical Decomposition of the Rank-Deficiency Set of a Matrix of Multivariate Polynomials (Q3576571) (← links)
- Practical and Theoretical Issues for the Computation of Generalized Critical Values of a Polynomial Mapping (Q3597979) (← links)
- Symbolic computation in hyperbolic programming (Q4561483) (← links)
- An FGLM-like algorithm for computing the radical of a zero-dimensional ideal (Q4599692) (← links)
- Modular equations for hyperelliptic curves (Q4821057) (← links)
- A fast randomized geometric algorithm for computing Riemann-Roch spaces (Q5113675) (← links)
- Effective de Rham cohomology — The general case (Q5225782) (← links)
- (Q5389777) (← links)
- A probabilistic algorithm to test local algebraic observability in polynomial time (Q5894826) (← links)
- On computing absolutely irreducible components of algebraic varieties with parameters (Q5962004) (← links)
- Differential Elimination for Dynamical Models via Projections with Applications to Structural Identifiability (Q6043379) (← links)
- Subresultants and the Shape Lemma (Q6045335) (← links)
- Rigid continuation paths II. structured polynomial systems (Q6103341) (← links)
- A signature-based algorithm for computing the nondegenerate locus of a polynomial system (Q6108370) (← links)
- \(u\)-generation: solving systems of polynomials equation-by-equation (Q6140899) (← links)
- Further perspectives on elimination (Q6166081) (← links)
- Jacobi's bound: Jacobi's results translated in Kőnig's, Egerváry's and Ritt's mathematical languages (Q6166083) (← links)
