# Simplification of nested radicals

@article{Landau1989SimplificationON, title={Simplification of nested radicals}, author={S. Landau}, journal={30th Annual Symposium on Foundations of Computer Science}, year={1989}, pages={314-319} }

Radical simplification is a fundamental mathematical question, as well as an important part of symbolic computation systems. The general denesting problem had not been known to be decidable. Necessary and sufficient conditions for a radical alpha over a field k to be denested, as well as the first algorithm to decide whether the expression can be denested, are given. The algorithm computes an equivalent expression of minimum nesting depth. It has running time polynomial in the size of the… Expand

#### Topics from this paper

#### One Citation

Simplifying nested radicals and solving polynomials by radicals in minimum depth

- Mathematics, Computer Science
- Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science
- 1990

#### References

SHOWING 1-10 OF 14 REFERENCES

Simplification of Expressions Involving Radicals

- Computer Science, Mathematics
- J. Symb. Comput.
- 1985

Decreasing the Nesting Depth of Expressions Involving Square Roots

- Computer Science, Mathematics
- J. Symb. Comput.
- 1985

Some Undecidable Problems Involving Elementary Functions of a Real Variable

- Mathematics, Computer Science
- J. Symb. Log.
- 1968

Algebraic factoring and rational function integration

- Mathematics, Computer Science
- SYMSAC '76
- 1976

Factoring Polynomials Over Algebraic Number Fields

- Mathematics, Computer Science
- SIAM J. Comput.
- 1985