Solving via Modular Methods

DOI10.1007/978-3-319-09186-0_1zbMath1328.13037arXiv1204.3442OpenAlexW1537265935MaRDI QIDQ3455092

Deeba Afzal, Faira Kanwal Janjua, Gerhard Pfister, Stefan Steidel

Publication date: 3 December 2015

Published in: Bridging Algebra, Geometry, and Topology (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1204.3442

zbMATH Keywords

triangular setspolynomial solvingmodular solving

Mathematics Subject Classification ID

Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10)

Related Items (1)

Usage of modular techniques for efficient computation of ideal operations

Uses Software

• Maple
• RegularChains
• SINGULAR
• SymbolicData

Cites Work

• Mapping integers and Hensel codes onto Farey fractions
• On decomposing systems of polynomial equations with finitely many solutions
• Triangular sets for solving polynomial systems: a comparative implementation of four methods
• Parallelization of modular algorithms
• A Singular Introduction to Commutative Algebra
• Unnamed Item

This page was built for publication: Solving via Modular Methods