Computing square roots faster than the Tonelli-Shanks/Bernstein algorithm (Q6089458)
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: Computing square roots faster than the Tonelli-Shanks/Bernstein algorithm |
scientific article; zbMATH DE number 7778574
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Computing square roots faster than the Tonelli-Shanks/Bernstein algorithm |
scientific article; zbMATH DE number 7778574 |
Statements
Computing square roots faster than the Tonelli-Shanks/Bernstein algorithm (English)
0 references
14 December 2023
0 references
square root
0 references
Tonelli-Shanks algorithm
0 references
table look-up
0 references
0.8373233675956726
0 references
0.797170102596283
0 references
