Title :
Simplifying nested radicals and solving polynomials by radicals in minimum depth
Author :
Horng, Gwoboa ; Huang, Ming-Deh A.
Author_Institution :
Dept. of Comput. Sci., Univ. of Southern California, Los Angeles, CA, USA
Abstract :
The notion of pure nested radicals and its field-theoretic counterpart, pure root extensions, are defined and used for investigating exact radical solutions
Keywords :
computational complexity; polynomials; minimum depth; nested radicals; polynomials; pure nested radicals; pure root extensions; Encoding; Equations; Gaussian processes; Polynomials;
Conference_Titel :
Foundations of Computer Science, 1990. Proceedings., 31st Annual Symposium on
Conference_Location :
St. Louis, MO
Print_ISBN :
0-8186-2082-X
DOI :
10.1109/FSCS.1990.89607
