scientific article; zbMATH DE number 599115

zbMath0814.14050MaRDI QIDQ4297380

Teresa Krick, Luis Miguel Pardo

Publication date: 22 August 1994

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

complexityeffective computation of Hilbert's zero theorem

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10) Number-theoretic algorithms; complexity (11Y16) Effectivity, complexity and computational aspects of algebraic geometry (14Q20)

Related Items

Lower bounds for diophantine approximations, Polar varieties, real equation solving, and data structures: the hypersurface case, Straight-line programs in geometric elimination theory, Cook's versus Valiant's hypothesis, A Gröbner free alternative for polynomial system solving, Kronecker's and Newton's approaches to solving: a first comparison, An algorithm for implicit interpolation