loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
2004 International Conference on Parallel Processing Workshops (ICPPW'04)
On Parallel Computation of Gr?bner Bases
Montreal, Quebec, Canada
August 15-August 18
ISBN: 0-7695-2198-3
ASCII Text
x 
 
Anton Leykin, "On Parallel Computation of Gr?bner Bases," Parallel Processing Workshops, International Conference on, pp. 160-164, 2004 International Conference on Parallel Processing Workshops (ICPPW'04), 2004.
 
 
BibTex
x
 
@article{ 10.1109/ICPPW.2004.1328011,
author = {Anton Leykin},
title = {On Parallel Computation of Gr?bner Bases},
journal ={Parallel Processing Workshops, International Conference on},
volume = {0},
year = {2004},
issn = {1530-2016},
pages = {160-164},
doi = {http://doi.ieeecomputersociety.org/10.1109/ICPPW.2004.1328011},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - CONF
JO - Parallel Processing Workshops, International Conference on
TI - On Parallel Computation of Gr?bner Bases
SN - 1530-2016
SP160
EP164
A1 - Anton Leykin,
PY - 2004
KW - null
VL - 0
JA - Parallel Processing Workshops, International Conference on
ER -
 
Anton Leykin, University of Illinois at Chicago
We have developed a coarse-grain parallelization of the Buchberger algorithm for computing Gr?obner bases in algebras of linear differential operators. The implementation of this algorithm provides good speedups on the majority of examples coming from these noncommutative algebras, which are superior to the speedups achieved for (commutative) polynomial rings.
Citation:
Anton Leykin, "On Parallel Computation of Gr?bner Bases," icppw, pp.160-164, 2004 International Conference on Parallel Processing Workshops (ICPPW'04), 2004
Usage of this product signifies your acceptance of the Terms of Use.