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)

Full work available at URL https://doi.org/10.1016/S0167-8191(05)80014-6

zbMATH Keywords

Boolean Gröbner basisdistributed memory multiprocessor

Mathematics Subject Classification ID

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

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

(4)

• A parallel implementation of Buchberger's algorithm over \(\mathbb{Z}_p\) for \(p\leq 31991\)
• Factorization of Boolean polynomials: parallel algorithms and experimental evaluation
• Efficient techniques for performing an irregular computation on distributed memory machines
• On the correctness of a distributed memory Gröbner basis algorithm

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)