Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

A parallel implementation of Buchberger's algorithm over \(\mathbb{Z}_p\) for \(p\leq 31991\)

From MaRDI portal
Publication:1264428
Jump to:navigation, search

DOI10.1006/jsco.1998.0208zbMath0983.68253OpenAlexW2092416399MaRDI QIDQ1264428

Alyson A. 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

Gröbner basesBuchberger's algorithm


Mathematics Subject Classification ID

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


Related Items (2)

Parallelization of matrix algorithms for Gröbner basis computation ⋮ Parallel algorithms for Gröbner-basis construction


Uses Software

  • Macaulay2



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

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1264428&oldid=13366749"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 31 January 2024, at 09:44.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki