Landau's algorithm: Difference between revisions
Content deleted Content added
m →Notes and references: Added 1 dois to journal cites using AWB (10090) |
just adding the refs to main article would be a lot more useful given the present state of this stub; see talk |
||
| Line 1: | Line 1: | ||
#REDIRECT [[nested radical]] |
|||
In mathematics, '''Landau's algorithm''', named after its creator [[Susan Landau]], is an [[algorithm]] for deciding which [[nested radical]]s can be denested.<ref>{{citation |
|||
|first=Susan|last=Landau|authorlink=Susan Landau |
|||
|title=Simplification of nested radicals |
|||
|journal=[[SIAM Journal on Computing]] |
|||
|volume=21 |
|||
|number=1 |
|||
|year=1992 |
|||
|pages=85–110 |
|||
|doi=10.1137/0221009}} ([http://www.computer.org/csdl/proceedings/focs/1989/1982/00/063496.pdf link to a conference version that can be viewed by anyone])</ref> |
|||
== Notes and references == |
|||
{{reflist}} |
|||
* {{cite web | first = Susan | last = Landau |authorlink=Susan Landau | title = A note on 'Zippel Denesting' | id = {{citeseerx|10.1.1.35.5512}} }} |
|||
* {{cite journal | first = Susan | last = Landau |authorlink=Susan Landau | title = How to Tangle with a Nested Radical | journal = [[Mathematical Intelligencer]] | volume = 16 | pages = 49–55 | year = 1994 | doi=10.1007/bf03024284}} |
|||
[[Category:Algebra]] |
|||
[[Category:Algebraic number theory]] |
|||
[[Category:Computer algebra]] |
[[Category:Computer algebra]] |
||
{{algebra-stub}} |
|||
Revision as of 08:05, 27 February 2015
Redirect to: