Paterson–Stockmeyer algorithm
GPTKB entity
Statements (18)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:algorithm
|
| gptkbp:alternativeTo |
gptkb:Horner's_method
|
| gptkbp:appliesTo |
dense polynomials
sparse polynomials |
| gptkbp:category |
polynomial algorithms
|
| gptkbp:citation |
gptkb:Paterson,_M._S.;_Stockmeyer,_L._J._(1973)._'On_the_Number_of_Nonscalar_Multiplications_Necessary_to_Evaluate_Polynomials.'_SIAM_Journal_on_Computing.
|
| gptkbp:complexity |
O(sqrt(n)) multiplications for degree n polynomial
|
| gptkbp:field |
gptkb:mathematics
computer science |
| https://www.w3.org/2000/01/rdf-schema#label |
Paterson–Stockmeyer algorithm
|
| gptkbp:improves |
polynomial evaluation efficiency
|
| gptkbp:proposedBy |
gptkb:Mike_Paterson
gptkb:Larry_Stockmeyer |
| gptkbp:reduces |
number of multiplications
|
| gptkbp:usedFor |
polynomial evaluation
|
| gptkbp:yearProposed |
1973
|
| gptkbp:bfsParent |
gptkb:Michael_S._Paterson
|
| gptkbp:bfsLayer |
7
|