Lower bounds for diophantine approximations

DOI10.1016/S0022-4049(97)00015-7zbMath0871.68101arXivalg-geom/9608010OpenAlexW2022078407MaRDI QIDQ1358914

J. E. Morais, Marc Giusti, José Luis Montaña, Klemens Hägele, Joos Heintz, Luis Miguel Pardo

Publication date: 23 June 1997

Published in: Journal of Pure and Applied Algebra (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/alg-geom/9608010

zbMATH Keywords

multivariate polynomial equation systems

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computational aspects of higher-dimensional varieties (14Q15) Approximation to algebraic numbers (11J68)

Related Items

Complexity results for triangular sets, Bounds for the Hilbert function of polynomial ideals and for the degrees in the Nullstellensatz, Generalized polar varieties: geometry and algorithms, Numeric vs. symbolic homotopy algorithms in polynomial system solving: a case study, Certifying solutions to overdetermined and singular polynomial systems over \(\mathbb{Q}\), On the complexity exponent of polynomial system solving, Polynomial equation solving by lifting procedures for ramified fibers, Deformation techniques to solve generalised Pham systems, Effective differential Lüroth's theorem, p-adic algorithm for bivariate Gröbner bases, Sparse resultants and straight-line programs, A concise proof of the Kronecker polynomial system solver from scratch, Further perspectives on elimination, Algorithms of intrinsic complexity for point searching in compact real singular hypersurfaces, Computing the equidimensional decomposition of an algebraic closed set by means of lifting fibers, Relaxed Hensel lifting of triangular sets, On the probability distribution of singular varieties of given corank, Computing multihomogeneous resultants using straight-line programs, On the bit complexity of polynomial system solving, Time-space tradeoffs in algebraic complexity theory, Deformation techniques for efficient polynomial equation solving., Change of order for regular chains in positive dimension, Intrinsic complexity estimates in polynomial optimization, Complexity of solving parametric polynomial systems, A Gröbner free alternative for polynomial system solving, Kronecker's and Newton's approaches to solving: a first comparison, On sign conditions over real multivariate polynomials, A parametric representation of totally mixed Nash equilibria, On the complexity of the resolvent representation of some prime differential ideals, Properness defects of projection and minimal discriminant variety, On computing absolutely irreducible components of algebraic varieties with parameters, Evaluation properties of invariant polynomials, An algorithm for implicit interpolation, A promenade through correct test sequences. I: Degree of constructible sets, Bézout's inequality and density, EVALUATION PROPERTIES OF SYMMETRIC POLYNOMIALS, Interpolation of polynomials given by straight-line programs, Deformation techniques for sparse systems, Unnamed Item, Evaluation techniques for zero-dimensional primary decomposition, A sparse effective Nullstellensatz, Fast computation of a rational point of a variety over a finite field, Algorithms for residues and Łojasiewicz exponents, Functional programming concepts and straight-line programs in computer algebra, Degeneracy loci and polynomial equation solving, Bit complexity for computing one point in each connected component of a smooth real algebraic set, Point searching in real singularcomplete intersection varieties: algorithms of intrinsic complexity, Systems of rational polynomial equations have polynomial size approximate zeros on the average

Uses Software

TERA

Cites Work