scientific article; zbMATH DE number 939812
From MaRDI portal
zbMath0878.11043MaRDI QIDQ4714022
Teresa Krick, Luis Miguel Pardo
Publication date: 5 January 1998
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
complete intersectiondiophantine approximationmembership problemeffective Nullstellensatzstraight-line programs
Analysis of algorithms and problem complexity (68Q25) Symbolic computation and algebraic computation (68W30) Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10) Number-theoretic algorithms; complexity (11Y16) Relevant commutative algebra (14A05) Diophantine approximation, transcendental number theory (11J99)
Related Items
Effective approximation of the solutions of algebraic equations, Complexity results for triangular sets, On the zeta Mahler measure function of the Jacobian determinant, condition numbers and the height of the generic discriminant, Lower bounds for diophantine approximations, Bounds for the Hilbert function of polynomial ideals and for the degrees in the Nullstellensatz, Generalized polar varieties: geometry and algorithms, Polynomial equation solving by lifting procedures for ramified fibers, Deformation techniques to solve generalised Pham systems, Straight-line programs in geometric elimination theory, Exploring implications of trace (inversion) formula and Artin algebras in extremal combinatorics, A concise proof of the Kronecker polynomial system solver from scratch, Computing the characteristic polynomial of multivariate polynomial matrices given by straight-line programs, Weak identifiability for differential algebraic systems, Computing the equidimensional decomposition of an algebraic closed set by means of lifting fibers, Bezoutian and quotient ring structure, Time-space tradeoffs in algebraic complexity theory, Deformation techniques for efficient polynomial equation solving., Cook's versus Valiant's hypothesis, Evaluating geometric queries using few arithmetic operations, Complexity of solving parametric polynomial systems, On a transfer theorem for the \(\text{P}\neq \text{NP}\) conjecture, 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, Computational arithmetic geometry. I: Sentences nearly in the polynomial hierarchy, On the complexity of the resolvent representation of some prime differential ideals, Computing bases of complete intersection rings in Noether position, Rational formulas for traces in zero-dimensional algebras, Matrices in elimination theory, A promenade through correct test sequences. I: Degree of constructible sets, Bézout's inequality and density, Unnamed Item, Evaluation techniques for zero-dimensional primary decomposition, A sparse effective Nullstellensatz, An effective algorithm for quantifier elimination over algebraically closed fields using straight line programs, Leibniz complexity of Nash functions on differentiations, 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, Condition number bounds for problems with integer coefficients, On the complexity of the \(F_5\) Gröbner basis algorithm, Effective equidimensional decomposition of affine varieties, Systems of rational polynomial equations have polynomial size approximate zeros on the average
