Jump to content

Landau's algorithm

Add links
From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by Michael Hardy (talk | contribs) at 20:29, 7 October 2009. The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

In mathematics, Landau's algorithm, named after Susan Landau, is an algorithm for deciding which nested radicals can be denested.[1]

Notes and references

  1. ^ S. Landau, "Simplification of Nested Radicals", SIAM Journal of Computation, volume 21 (1992), pages 85–110.[1]
Stub icon

This algebra-related article is a stub. You can help Wikipedia by expanding it.

Retrieved from "https://en.wikipedia.org/w/index.php?title=Landau%27s_algorithm&oldid=318524256"