Modeling UpLink power control with outage probabilities
Kenneth L. Clarkson, K. Georg Hampel, et al.
VTC Spring 2007
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.
Kenneth L. Clarkson, K. Georg Hampel, et al.
VTC Spring 2007
Hannaneh Hajishirzi, Julia Hockenmaier, et al.
UAI 2011
Guo-Jun Qi, Charu Aggarwal, et al.
IEEE TPAMI
Fernando Martinez, Juntao Chen, et al.
AAAI 2025