Algorithmadvanced
Fast multipoint evaluation
Also called subproduct-tree evaluation.
Evaluates a polynomial at n points in O(M(n) log n) by remainder descent down the subproduct tree.
Evaluates a polynomial at n points in O(M(n) log n) by remainder descent down the subproduct tree.
About this page
The build computes these levels from the evidence in the repository. Each row says what the next level needs. Read what the levels mean.
| Ladder | Level | What the next level needs |
|---|---|---|
| Human proof | H0 no proof |
|
| Lean | L0 no Lean part |
|
| Visual | V0 none |
|
| Writing | W0 stub |
|
Tag VW4WSE Edit this page History Report an error