A logarithmic Boolean time algorithm for parallel polynomial division (Q1107986)
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: A logarithmic Boolean time algorithm for parallel polynomial division |
scientific article; zbMATH DE number 4066311
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A logarithmic Boolean time algorithm for parallel polynomial division |
scientific article; zbMATH DE number 4066311 |
Statements
A logarithmic Boolean time algorithm for parallel polynomial division (English)
0 references
1987
0 references
parallel computational complexity
0 references
Boolean circuit complexity
0 references
polynomial division
0 references
triangular Toeplitz matrix inversion
0 references
interpolation by binary segmentation
0 references
division with remainder
0 references
integer polynomials
0 references
0 references
0 references
0.8679012656211853
0 references
0.8137071132659912
0 references
0.8107182383537292
0 references
0.7951782941818237
0 references
