A tight bound for approximating the squa
β
Nader H. Bshouty; Yishay Mansour; Baruch Schieber; Prasoon Tiwari
π
Article
π
1997
π
Elsevier Science
π
English
β 285 KB
We prove an R (log log( l/c) ) lower bound on the depth of any computation tree and any RAM program with operations {+, -, \*, /, [.j, not, and, br, xor}, unlimited power of answering YES/NO questions, and constants (0.1) that computes 4 to accuracy E, for all x E [ 1,2]. Since the Newton method ach