Landau's algorithm
In mathematics, Landau's algorithm, named after its creator 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)
- Landau, Susan. "A note on 'Zippel Denesting'". CiteSeerx: 10.1.1.35.5512.
{{cite web}}: Missing or empty|url=(help) - Landau, Susan (1994). "How to Tangle with a Nested Radical". Mathematical Intelligencer. 16: 49–55. doi:10.1007/bf03024284.
 | This algebra-related article is a stub. You can help Wikipedia by expanding it. |