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

Parallelization of the Buchberger algorithm

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

DOI10.1007/BF02366919zbMath0856.68078MaRDI QIDQ1907790

Yanyan Li

Publication date: 27 March 1996

Published in: Cybernetics and Systems Analysis (Search for Journal in Brave)


zbMATH Keywords

Buchberger's completion 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) Distributed algorithms (68W15)


Related Items (1)

Tools for simulation of parallel computations in a system of algebraic programming


Uses Software

  • APS
  • Unnamed Item



Cites Work

  • History and basic features of the critical-pair/completion procedure
  • Computations in APS
  • Deductive tools of an algebraic programming system




This page was built for publication: Parallelization of the Buchberger algorithm

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1907790&oldid=14321345"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
This page was last edited on 1 February 2024, at 14:10.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki