The following pages link to Kronecker (Q13252):
Displaying 50 items.
- A softly optimal Monte Carlo algorithm for solving bivariate polynomial systems over the integers (Q272196) (← links)
- Deterministic root finding over finite fields using Graeffe transforms (Q300881) (← links)
- Solving bivariate systems using rational univariate representations (Q325154) (← links)
- Modular composition modulo triangular sets and applications (Q371190) (← links)
- On the complexity of the generalized MinRank problem (Q390388) (← links)
- Computing isolated roots of sparse polynomial systems in affine space (Q410703) (← links)
- Root isolation of zero-dimensional polynomial systems with linear univariate representation (Q420751) (← links)
- Variant quantifier elimination (Q420753) (← links)
- Algorithms of intrinsic complexity for point searching in compact real singular hypersurfaces (Q431820) (← links)
- Relaxed algorithms for \(p\)-adic numbers (Q449711) (← links)
- A probabilistic symbolic algorithm to find the minimum of a polynomial function on a basic closed semialgebraic set (Q464735) (← 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)
- Polynomial equation solving by lifting procedures for ramified fibers (Q598210) (← links)
- Deformation techniques to solve generalised Pham systems (Q598226) (← links)
- The first rational Chebyshev knots (Q607058) (← 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)
- Computing the equidimensional decomposition of an algebraic closed set by means of lifting fibers (Q652454) (← links)
- Bit-size estimates for triangular sets in positive dimension (Q657656) (← links)
- A geometric index reduction method for implicit systems of differential algebraic equations (Q719759) (← links)
- Properness defects of projection and minimal discriminant variety (Q719760) (← links)
- Evaluation properties of invariant polynomials (Q731933) (← links)
- An algorithm for implicit interpolation (Q744017) (← links)
- Effective approximation of the solutions of algebraic equations (Q820948) (← links)
- Blind algebraic identification of communication channels: symbolic solution algorithms (Q857886) (← links)
- Real root finding for determinants of linear matrices (Q898255) (← 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)
- 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)
- Foveal detection and approximation for singularities. (Q1399097) (← links)
- Fast algorithms for zero-dimensional polynomial systems using duality (Q1422204) (← links)
- The hardness of polynomial equation solving (Q1430505) (← links)
- Resolvent representation for regular differential ideals (Q1566397) (← links)
- The Projective Noether Maple Package: Computing the dimension of a projective variety (Q1587230) (← links)
- Some speed-ups and speed limits for real algebraic geometry (Q1594829) (← links)
- Sparse resultants and straight-line programs (Q1690776) (← links)
- Bit complexity for multi-homogeneous polynomial system solving -- application to polynomial minimization (Q1690788) (← links)
- Complexity of triangular representations of algebraic sets (Q1714872) (← links)
- On the bit complexity of polynomial system solving (Q1734694) (← links)
- On solving univariate sparse polynomials in logarithmic time (Q1763426) (← links)
- Solving polynomial equations. Foundations, algorithms, and applications (Q1776342) (← links)
- Functional programming concepts and straight-line programs in computer algebra (Q1849848) (← links)
- Quadratic Newton iteration for systems with multiplicity (Q1865830) (← links)
- Systems of rational polynomial equations have polynomial size approximate zeros on the average (Q1869964) (← links)
- Complexity results for triangular sets (Q1878489) (← links)
