A parallel implementation of Buchberger's algorithm over Z_p for p 31991

DOI10.1006/JSCO.1998.0208MaRDI QIDQ1264428zbMATH OpenOpenAlexFDO

Authors Alyson Reeves

Publication date 27 June 2000

Published in Journal of Symbolic Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1006/jsco.1998.0208

zbMATH Keywords

Buchberger's algorithmGröbner bases

Mathematics Subject Classification ID

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

Recommendations

• Extended parallelism in the Gröbner basis algorithm
• Strategy-accurate parallel Buchberger algorithms
• A MIMD implementation of the Buchberger algorithm for Boolean polynomials
• Parallel algorithms for Gröbner-basis construction
• Parallel computation of Gröbner bases on distributed memory machines

Cited in

(12)

• Parallel computation of Gröbner bases on distributed memory machines
• Parallelization of the Buchberger algorithm
• Threaded Gröbner bases: a Macaulay2 package
• Parallelization of modular algorithms
• Parallelization of matrix algorithms for Gröbner basis computation
• Parallel algorithms for Gröbner-basis construction
• Parallel computation of Janet and Gröbner bases over rational numbers
• Generic and parallel Groebner bases in JAS (extended abstract)
• Parallel reduction of matrices in Gröbner bases computations
• scientific article; zbMATH DE number 1163445 (Why is no real title available?)
• Extended parallelism in the Gröbner basis algorithm
• A MIMD implementation of the Buchberger algorithm for Boolean polynomials

Describes a project that uses

Uses Software

• Macaulay2

This page was built for publication: A parallel implementation of Buchberger's algorithm over \(\mathbb{Z}_p\) for \(p\leq 31991\)

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