A combinatorial proof of the effective Nullstellensatz
From MaRDI portal
Publication:2368067
DOI10.1006/jsco.1993.1020zbMath0783.13023OpenAlexW2049116960MaRDI QIDQ2368067
Publication date: 22 August 1993
Published in: Journal of Symbolic Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/jsco.1993.1020
Polynomial rings and ideals; rings of integer-valued polynomials (13F20) Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10) Effectivity, complexity and computational aspects of algebraic geometry (14Q20) Relevant commutative algebra (14A05)
Related Items
Bounds of traces in complete intersections and degrees in the Nullstellensatz, Bounds for the Hilbert function of polynomial ideals and for the degrees in the Nullstellensatz, Straight-line programs in geometric elimination theory, New effective differential Nullstellensatz, Proof mining and effective bounds in differential polynomial rings, Random arithmetic formulas can be reconstructed efficiently, A bound for orders in differential Nullstellensatz, Inequalities for Hilbert functions and primary decompositions, A sparse effective Nullstellensatz
