scientific article; zbMATH DE number 1057737
From MaRDI portal
Publication:4352783
Recommendations
- Complexity bounds in elimination theory -- a survey.
- On the intrinsic complexity of elimination problems in effective algebraic geometry
- Software engineering and complexity in effective algebraic geometry
- Algebraic complexity theory. I: An introduction
- On the intrinsic complexity of elimination theory
Cited in
(32)- Deformation techniques for sparse systems
- Evaluation techniques for zero-dimensional primary decomposition
- A sparse effective Nullstellensatz
- Lower bounds for diophantine approximations
- Polar varieties, real equation solving, and data structures: the hypersurface case
- Straight-line programs in geometric elimination theory
- Computing the characteristic polynomial of multivariate polynomial matrices given by straight-line programs
- Complexity bounds in elimination theory -- a survey.
- Functional programming concepts and straight-line programs in computer algebra
- Systems of rational polynomial equations have polynomial size approximate zeros on the average
- Fast computation of discrete invariants associated to a differential rational mapping
- Complexity results for triangular sets
- Time-space tradeoffs in algebraic complexity theory
- A promenade through correct test sequences. I: Degree of constructible sets, Bézout's inequality and density
- A concise proof of the Kronecker polynomial system solver from scratch
- An arithmetic Poisson formula for the multi-variate resultant
- On the probability distribution of singular varieties of given corank
- On Kolmogorov complexity in the real Turing machine setting
- Fast computation of a rational point of a variety over a finite field
- Effective de Rham cohomology — The general case
- A Gröbner free alternative for polynomial system solving
- Kronecker's and Newton's approaches to solving: a first comparison
- A new method to obtain lower bounds for polynomial evaluation
- Polynomial equation solving by lifting procedures for ramified fibers
- Deformation techniques to solve generalised Pham systems
- Exploring implications of trace (inversion) formula and Artin algebras in extremal combinatorics
- Computing the equidimensional decomposition of an algebraic closed set by means of lifting fibers
- Properness defects of projection and minimal discriminant variety
- A Kronecker algorithm for locally closed sets over a perfect field
- Erzeugungsgrad, VC-dimension and neural networks with rational activation function
- Differential elimination and algebraic invariants of polynomial dynamical systems
- An algorithm for implicit interpolation
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 Q4352783)
