On the complexity of the D5 principle (Q3568138)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5722793
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the complexity of the D5 principle |
scientific article; zbMATH DE number 5722793 |
Statements
17 June 2010
0 references
triangular set of polynomials
0 references
operations computation
0 references
GCD computation
0 references
complexity
0 references
0.7569688558578491
0 references
0.7520943284034729
0 references
0.7420268654823303
0 references
0.7316769361495972
0 references
0.7269923090934753
0 references
