Conference paper
Performance test case generation for microprocessors
Pradip Bose
VTS 1998
We prove an Ω(log log(1/ε)) lower bound on the depth of any computation tree and any RAM program with operations {+, -, *, /, ⌊·⌋, not, and, or, xor}, unlimited power of answering YES/NO questions, and constants {0,1} that computes √x to accuracy ε, for all x ∈ [1,2]. Since the Newton method achieves such an accuracy in O(log log(1/ε)) depth, our bound is tight. © 1997 Published by Elsevier Science B.V.
Pradip Bose
VTS 1998
Kaoutar El Maghraoui, Gokul Kandiraju, et al.
WOSP/SIPEW 2010
Bowen Zhou, Bing Xiang, et al.
SSST 2008
Khalid Abdulla, Andrew Wirth, et al.
ICIAfS 2014