scientific article; zbMATH DE number 1057749
From MaRDI portal
Publication:4352797
Recommendations
- scientific article; zbMATH DE number 3959582
- Efficient solution of real polynomial systems of equations
- Efficient polynomial system-solving by numerical methods
- Efficient polynomial system solving by numerical methods
- Systems with parameters, or efficiently solving systems of polynomial equations: 33 years later. I
- Systems with parameters, or efficiently solving systems of polynomial equations 33 years later. II
- Solving polynomial systems equation by equation
- Accelerated Solution of Multivariate Polynomial Systems of Equations
- Fast algorithms for polynomial solutions of linear differential equations
- Systems with parameters, or efficiently solving systems of polynomial equations: 33 years later. III
Cited in
(49)- An algorithm for implicit interpolation
- Effective de Rham cohomology — The general case
- Matrices in elimination theory
- Solving determinantal systems using homotopy techniques
- A concise proof of the Kronecker polynomial system solver from scratch
- Degeneracy loci and polynomial equation solving
- Change of order for regular chains in positive dimension
- Systems of rational polynomial equations have polynomial size approximate zeros on the average
- Interpolation of polynomials given by straight-line programs
- Complexity results for triangular sets
- Solving parametric systems of polynomial equations over the reals through Hermite matrices
- p-adic algorithm for bivariate Gröbner bases
- Bit complexity for computing one point in each connected component of a smooth real algebraic set
- A baby steps/giant steps probabilistic algorithm for computing roadmaps in smooth bounded real hypersurface
- Computing the equidimensional decomposition of an algebraic closed set by means of lifting fibers
- Algorithms of intrinsic complexity for point searching in compact real singular hypersurfaces
- Lower bounds for diophantine approximations
- Computing the characteristic polynomial of multivariate polynomial matrices given by straight-line programs
- A Gröbner free alternative for polynomial system solving
- Properness defects of projection and minimal discriminant variety
- Polar varieties, real equation solving, and data structures: the hypersurface case
- Further perspectives on elimination
- On types of isolated KKT points in polynomial optimization
- On the complexity exponent of polynomial system solving
- Evaluation properties of invariant polynomials
- Straight-line programs in geometric elimination theory
- Polynomial equation solving by lifting procedures for ramified fibers
- Bit complexity for multi-homogeneous polynomial system solving -- application to polynomial minimization
- Evaluation techniques for zero-dimensional primary decomposition
- Computing critical points for invariant algebraic systems
- Fast computation of a rational point of a variety over a finite field
- Kronecker's and Newton's approaches to solving: a first comparison
- Counting solutions of a polynomial system locally and exactly
- On the complexity of the resolvent representation of some prime differential ideals
- Some speed-ups and speed limits for real algebraic geometry
- Solving degenerate sparse polynomial systems faster
- Positive dimensional parametric polynomial systems, connectivity queries and applications in robotics
- On types of degenerate critical points of real polynomial functions
- On the intrinsic complexity of the arithmetic Nullstellensatz
- An \(\mathfrak{m}\)-adic algorithm for bivariate Gröbner bases
- Point searching in real singularcomplete intersection varieties: algorithms of intrinsic complexity
- Solving projective complete intersection faster
- Deformation techniques to solve generalised Pham systems
- Computing bases of complete intersection rings in Noether position
- scientific article; zbMATH DE number 4096783 (Why is no real title available?)
- Functional programming concepts and straight-line programs in computer algebra
- On the probability distribution of singular varieties of given corank
- Time-space tradeoffs in algebraic complexity theory
- Homotopy techniques for solving sparse column support determinantal polynomial systems
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4352797)
