Arnon Amir, Michael Lindenbaum
IEEE Transactions on Pattern Analysis and Machine Intelligence
We develop the theory for decreasing the depth of nesting in expressions that contain square roots. We show exactly when fourth roots enable denesting of expressions not denestable with square roots only, When we restrict our attention to denesting over the real numbers, we show in fact that no roots other than square roots or fourth roots are ever useful for denesting expressions containing square roots only, thus characterising the denestable expressions in this case . We then proceed to describe new algorithms that accomplish such denesting. © 1985, Academic Press Inc. (London) Ltd.. All rights reserved.
Arnon Amir, Michael Lindenbaum
IEEE Transactions on Pattern Analysis and Machine Intelligence
Imran Nasim, Michael E. Henderson
Mathematics
Robert F. Gordon, Edward A. MacNair, et al.
WSC 1985
Martin Charles Golumbic, Renu C. Laskar
Discrete Applied Mathematics