Corpus ID: 118900751

The intrinsic complexity of parametric elimination methods

  title={The intrinsic complexity of parametric elimination methods},
  author={Joos Heintz and Guillermo Matera and Luis M. Pardo and R. Wachenchauzer},
  journal={arXiv: Algebraic Geometry},
This paper is devoted to the complexity analysis of a particular property, called algebraic robustness owned by all known symbolic methods of parametric polynomial equation solving (geometric elimination). It is shown that any parametric elimination procedure which owns this property must neccessarily have an exponential sequential time complexity even if highly performant data structures (as e.g. the straight–line program encoding of polynomials) are used. The paper finishes with the motivated… Expand
Software Engineering and complexity in effective Algebraic Geometry
A circuit based computation model is presented which captures all known symbolic elimination algorithms in effective Algebraic Geometry and exhibits a class of simple elimination problems which require exponential size circuits to be solved in this model. Expand
Software Engineering and Complexity in Eective
We introduce the notion of a robust parameterized arithmetic circuit for the evaluation of algebraic families of multivariate polynomials. Based on this notion, we present a computation model,Expand
Some lower bounds for the complexity of the linear programming feasibility problem over the reals
It is proved that the set I^(^2^n^,^ n^), of parameters describing nonempty polyhedra, has an exponential number of limiting hypersurfaces, and the existence of a constant c>1 such that, if dense or sparse representation is used to code polynomials, the length of any quantifier-free formula expressing the set is bounded from below by @W(c^n). Expand
A concise proof of the Kronecker polynomial system solver from scratch
Abstract Nowadays polynomial system solvers are involved in sophisticated computations in algebraic geometry as well as in practical engineering. The most popular algorithms are based on GrobnerExpand
Fast computation of a rational point of a variety over a finite field
A probabilistic algorithm which computes a rational point of an absolutely irreducible variety over a finite field defined by a reduced regular sequence that works for fields of any characteristic, but requires the cardinality of the field to be greater than a quantity. Expand
Upper and Lower Complexity Bounds for Some Problems in Elementary Geometry
In this chapter, we analyze the algebraic complexity of the linear programming feasibility problem over the reals and prove non-trivial lower bounds for this problem. The linear programmingExpand
Robust Algorithms For Generalized Pham Systems
A robust probabilistic algorithm which solves generalized Pham systems with quadratic complexity in the Bézout number of the input system, together with a “projection algorithm” which allows to move the solutions of the known instance to the solution of an arbitrary instance along the parameter space. Expand
On Smale's 17th Problem: A Probabilistic Positive Solution
A uniform probabilistic algorithm is presented for Smale's 17th Problem and it is proved that the complexity of this problem is polynomial. Expand
Algorithmes pour la décomposition primaire des idéaux polynomiaux de dimension nulle donnés en évaluation
Les algorithmes de resolution polynomiale sont impliques dans des outils sophistiques de calcul en geometrie algebrique aussi bien quen ingenierie. Les plus populaires dentre eux reposent sur desExpand
Algoritmos de deformación para la resolución de sistemas polinomiales
Esta tesis esta dedicada a ciertas tareas computacionales de geometria algebraica en caracteristica cero. Apuntamos a analizar y descubrir la complejidad de problemas definidos por sistemas deExpand


On the Intrinsic Complexity of Elimination Theory
The intrinsic complexity of selected algorithmic problems of classical elimination theory in algebraic geometry is considered and reductions of fundamental questions of elimination theory to NP- and P#-complete problems are given and it is confirmed that some of these questions may have exponential size outputs. Expand
Lower bounds for diophantine approximations
Abstract We introduce a subexponential algorithm for geometric solving of multivariate polynomial equation systems whose bit complexity depends mainly on intrinsic geometric invariants of theExpand
Lower Bounds for diophantine Approximation
We introduce a subexponential algorithm for geometric solving of multivariate polynomial equation systems whose bit complexity depends mainly on intrinsic geometric invariants of the solution set.Expand
Straight--Line Programs in Geometric Elimination Theory
We present a new method for solving symbolically zero-dimensional polynomial equation systems in the affine and toric case. The main feature of our method is the use of problem adapted dataExpand
On the Complexity of Sparse Elimination
  • I. Emiris
  • Computer Science, Mathematics
  • J. Complex.
  • 1996
This work offers a new simple proof relying on the construction of a sparse resultant matrix, which leads to the computation of a multiplication map and all common zeros, and proves a lower bound on mixed volume in terms of Euclidean volume which is of independent interest. Expand
Algebraic complexity theory
This is the first book to present an up-to-date and self-contained account of Algebraic Complexity Theory that is both comprehensive and unified. Requiring of the reader only some basic algebra andExpand
Complexity and Real Computation
  • L. Blum
  • Mathematics, Computer Science
  • Springer New York
  • 1998
This chapter discusses decision problems and Complexity over a Ring and the Fundamental Theorem of Algebra: Complexity Aspects. Expand
Ideals, Varieties, and Algorithms: An Introduction to Computational Algebraic Geometry and Commutative Algebra, 3/e (Undergraduate Texts in Mathematics)
Algebraic Geometry is the study of systems of polynomial equations in one or more variables, asking such questions as: Does the The denominator is taking on this, book interested. This book forExpand
The Complexity of Partial Derivatives
Using the nonscalar complexity in k, the complexity of single power sums, single elementary symmetric functions, the resultant and the discriminant as root functions are determined up to order of magnitude. Expand
On a theory of computation and complexity over the real numbers: $NP$- completeness, recursive functions and universal machines
We present a model for computation over the reals or an arbitrary (ordered) ring R. In this general setting, we obtain universal machines, partial recursive functions, as well as JVP-completeExpand