scientific article; zbMATH DE number 599115

zbMATH Open0814.14050MaRDI QIDQ4297380FDOQ4297380

Authors: Teresa Krick, Luis Miguel Pardo 

Publication date: 22 August 1994

Title of this publication is not available (Why is that?)

Recommendations

• scientific article; zbMATH DE number 939812
• A computer approach to number theory
• scientific article; zbMATH DE number 3914403
• The Computational Complexity of Simultaneous Diophantine Approximation Problems
• Efficient computing of \(n\)-dimensional simultaneous Diophantine approximation problems
• scientific article; zbMATH DE number 1104003
• scientific article
• Some ideas on computational Diophantine equations
• scientific article
• scientific article; zbMATH DE number 500957

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)

Cited In (8)

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

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4297380)