On the intrinsic complexity of elimination theory

Related Items

Black-box polynomial resultants, On Kolmogorov complexity in the real Turing machine setting, Lower bounds for diophantine approximations, Simplified lower bounds for polynomials with algebraic coefficients, On the intractability of Hilbert's Nullstellensatz and an algebraic version of ``\(NP\neq P\)?, Straight-line programs in geometric elimination theory, Gröbner bases for polynomial systems with parameters, Continuity properties for flat families of polynomials. I: Continuous parametrizations, Model checking in the modal \(\mu \)-calculus and generic solutions, Lower complexity bounds for interpolation algorithms, An arithmetic Poisson formula for the multi-variate resultant, Time-space tradeoffs in algebraic complexity theory, Counting and Gröbner bases, Counting complexity classes for numeric computations. II: Algebraic and semialgebraic sets, A new method to obtain lower bounds for polynomial evaluation, Some lower bounds for the complexity of the linear programming feasibility problem over the reals, Complexity bounds in elimination theory -- a survey.