The following pages link to Kronecker (Q13252):
Displaying 50 items.
- The computational complexity of the Chow form (Q1879037) (← links)
- Software engineering and complexity in effective algebraic geometry (Q1931431) (← links)
- Homotopy techniques for solving sparse column support determinantal polynomial systems (Q1979422) (← links)
- Multilinear polynomial systems: root isolation and bit complexity (Q1994888) (← links)
- Fast computation of generic bivariate resultants (Q1996880) (← links)
- Certified non-conservative tests for the structural stability of discrete multidimensional systems (Q2002386) (← links)
- Deterministic normal position transformation and its applications (Q2006776) (← links)
- On Bézout inequalities for non-homogeneous polynomial ideals (Q2028993) (← links)
- Lexicographic Gröbner bases of bivariate polynomials modulo a univariate one (Q2066949) (← links)
- Computing critical points for invariant algebraic systems (Q2100065) (← links)
- Solving parametric systems of polynomial equations over the reals through Hermite matrices (Q2117425) (← links)
- A generalization of the Boulier-Buchberger criterion for the computation of characteristic sets of differential ideals (Q2122135) (← links)
- 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)
- Efficient polynomial system-solving by numerical methods (Q2431371) (← links)
- Testing sign conditions on a multivariate polynomial and applications (Q2465578) (← 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)
- (Q2715540) (← links)
- Exact Algorithms for Linear Matrix Inequalities (Q2834563) (← links)
- Point searching in real singularcomplete intersection varieties: algorithms of intrinsic complexity (Q2871188) (← links)
- (Q3070806) (← links)
- (Q3105510) (← links)
- Fast computation of a rational point of a variety over a finite field (Q3420246) (← links)
- (Q3421275) (← links)
- Numerical Decomposition of the Rank-Deficiency Set of a Matrix of Multivariate Polynomials (Q3576571) (← links)
- (Q3577510) (← links)