Complexity and applications of parametric algorithms of computational algebraic geometry

MaRDI QIDQ4945804zbMATH OpenFDO

Authors Marek Ryszard Rychlik

Publication date 20 March 2001

zbMATH Keywords

computational algebraic geometrygeometric theorem provingGröbner basis softwareparametric equations

Mathematics Subject Classification ID

Computational aspects of higher-dimensional varieties (14Q15)

Recommendations

• Comprehensive Gröbner bases
• Computer algebra and algebraic geometry -- achievements and perspectives
• scientific article; zbMATH DE number 4065139
• The Gröbner cover
• Computing with parameterized varieties

Cited in

(11)

• Towards massively parallel computations in algebraic geometry
• Parametric standard bases and their applications
• Improving the DISPGB algorithm using the discriminant ideal
• Software for discussing parametric polynomial systems: the Gröbner cover
• Computing with parameterized varieties
• scientific article; zbMATH DE number 5302299 (Why is no real title available?)
• scientific article; zbMATH DE number 4065139 (Why is no real title available?)
• scientific article; zbMATH DE number 1023365 (Why is no real title available?)
• Software for computing the Gröbner cover of a parametric ideal
• Gröbner bases for polynomial systems with parameters
• Presentation of the book The Gröbner cover

Describes a project that uses

Uses Software

• LISP

This page was built for publication: Complexity and applications of parametric algorithms of computational algebraic geometry

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