A MIMD implementation of the Buchberger algorithm for Boolean polynomials

DOI10.1016/S0167-8191(05)80014-6MaRDI QIDQ757067zbMATH OpenFDO

Authors Pascale Sénéchaud

Publication date 1991

Published in Parallel Computing (Search for Journal in Brave)

zbMATH Keywords

distributed memory multiprocessor[https://portal.mardi4nfdi.de/w/index.php?title=+Special%3ASearch&search=Boolean+Gr%EF%BF%BD%EF%BF%BDbner+basis&go=Go Boolean Gr��bner basis]

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Deformations and infinitesimal methods in commutative ring theory (13D10)

Recommendations

• Strategy-accurate parallel Buchberger algorithms
• Extended parallelism in the Gröbner basis algorithm
• A parallel implementation of Buchberger's algorithm over \(\mathbb{Z}_p\) for \(p\leq 31991\)
• Parallel computation of Gröbner bases on distributed memory machines
• On the implementation of Boolean Gröbner bases

Cited in

(3)

• Factorization of Boolean polynomials: parallel algorithms and experimental evaluation
• On the correctness of a distributed memory Gröbner basis algorithm
• Efficient techniques for performing an irregular computation on distributed memory machines

This page was built for publication: A MIMD implementation of the Buchberger algorithm for Boolean polynomials

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