Landau's algorithm
In mathematics, Landau's algorithm, named after Susan Landau, is an algorithm for deciding which nested radicals can be denested.[1]
Notes and references
- ^ Landau, Susan (1992), "Simplification of nested radicals", SIAM Journal on Computing, 21 (1): 85–110, doi:10.1137/0221009 (link to a conference version that can be viewed by anyone)
- Susan Landau, "A note on 'Zippel Denesting'"
- Susan Landau, "How to Tangle with a Nested Radical." Mathematical Intelligencer, 16, 49–55, 1994.
 | This algebra-related article is a stub. You can help Wikipedia by expanding it. |