Parallel algorithms on greatest common divisor of polynomial system (Q2886844)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Parallel algorithms on greatest common divisor of polynomial system |
scientific article; zbMATH DE number 6041462
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Parallel algorithms on greatest common divisor of polynomial system |
scientific article; zbMATH DE number 6041462 |
Statements
1 June 2012
0 references
polynomial system
0 references
greatest common divisor
0 references
parallel algorithm
0 references
pseudo-code system
0 references
Parallel algorithms on greatest common divisor of polynomial system (English)
0 references
0.8245049715042114
0 references
0.8205865621566772
0 references
0.8130204081535339
0 references
0.8130006790161133
0 references
