Pages that link to "Item:Q2427141"
From MaRDI portal
The following pages link to A concise proof of the Kronecker polynomial system solver from scratch (Q2427141):
Displaying 21 items.
- Kronecker (Q13252) (← links)
- Algorithms of intrinsic complexity for point searching in compact real singular hypersurfaces (Q431820) (← links)
- Relaxed algorithms for \(p\)-adic numbers (Q449711) (← links)
- A geometric index reduction method for implicit systems of differential algebraic equations (Q719759) (← links)
- An algorithm for implicit interpolation (Q744017) (← links)
- Effective approximation of the solutions of algebraic equations (Q820948) (← links)
- A parametric representation of totally mixed Nash equilibria (Q979929) (← links)
- Deformation techniques for sparse systems (Q1029552) (← links)
- Evaluation techniques for zero-dimensional primary decomposition (Q1030246) (← links)
- Generators of the ideal of an algebraic space curve (Q1030254) (← links)
- On the bit complexity of polynomial system solving (Q1734694) (← links)
- Fast computation of generic bivariate resultants (Q1996880) (← links)
- Deterministic normal position transformation and its applications (Q2006776) (← links)
- On Bézout inequalities for non-homogeneous polynomial ideals (Q2028993) (← links)
- Computing real radicals and \(S\)-radicals of polynomial systems (Q2200311) (← links)
- Intrinsic complexity estimates in polynomial optimization (Q2251913) (← links)
- Degeneracy loci and polynomial equation solving (Q2340506) (← links)
- On the complexity exponent of polynomial system solving (Q2658549) (← links)
- Point searching in real singularcomplete intersection varieties: algorithms of intrinsic complexity (Q2871188) (← links)
- Segre class computation and practical applications (Q5235111) (← links)
- Segre-driven radicality testing (Q6184180) (← links)
