Landau's algorithm
From Wikipedia, the free encyclopedia
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.
- Landau, Susan (1994). "How to Tangle with a Nested Radical". Mathematical Intelligencer 16: 49–55.
This article is issued from Wikipedia. The text is available under the Creative Commons Attribution/Share Alike; additional terms may apply for the media files.