On the intrinsic complexity of the arithmetic Nullstellensatz
From MaRDI portal
Publication:1969498
DOI10.1016/S0022-4049(98)00148-0zbMath0971.14042WikidataQ126550502 ScholiaQ126550502MaRDI QIDQ1969498
Martín Sombra, J. E. Morais, Klemens Hägele, Luis Miguel Pardo
Publication date: 19 October 2001
Published in: Journal of Pure and Applied Algebra (Search for Journal in Brave)
heightdegreeeffective Nullstellensatzeliminationarithmetic networkencoding of polynomials by straight-line programs
Analysis of algorithms and problem complexity (68Q25) Computational aspects of higher-dimensional varieties (14Q15) Relevant commutative algebra (14A05)
Related Items
Reductions modulo primes of systems of polynomial equations and algebraic dynamical systems, Deformation techniques to solve generalised Pham systems, A concise proof of the Kronecker polynomial system solver from scratch, Computing the equidimensional decomposition of an algebraic closed set by means of lifting fibers, On the bit complexity of polynomial system solving, Deformation techniques for efficient polynomial equation solving., A Gröbner free alternative for polynomial system solving, Kronecker's and Newton's approaches to solving: a first comparison, Computing bases of complete intersection rings in Noether position, An algorithm for implicit interpolation, Evaluation techniques for zero-dimensional primary decomposition, A sparse effective Nullstellensatz, Systems of rational polynomial equations have polynomial size approximate zeros on the average
