Algorithmadvanced
Half-GCD
Also called Half-GCD algorithm, Knuth-Schonhage half-gcd, Schonhage half-gcd, Schönhage's half-GCD, subquadratic GCD.
A divide-and-conquer gcd for big integers and polynomials that runs in quasi-linear time.
A divide-and-conquer gcd for big integers and polynomials that runs in quasi-linear time.
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 NZPF3Q Edit this page History Report an error