Lower Bounds for Computations with the Floor Operation
暂无分享,去创建一个
A general lower bound technique is developed for computation trees with operations $\{ + , - , * ,/,\lfloor \cdot \rfloor , < \} $ and constants $\{ 0,1\} $, for functions that have as their input a single n-bit integer. The technique applies to many natural functions, such as perfect square root (deciding if the square root of the input is integral or not), computing the parity of $\lfloor {\log x} \rfloor $ , etc. The arguments are then extended to obtain the same lower bounds on the time complexity of any RAM program with operations $\{ + , - , * ,/,\lfloor \cdot \rfloor , < \} $ that solves the problem. Another related result is described in a companion paper [Proc. 29th IEEE Symposium on Foundations of Computer Science, 1988] and [J. Assoc. Comput. Mach., 1991, to appear].
[1] Friedhelm Meyer auf der Heide,et al. Lower Time Bounds for Integer Programming with Two Variables , 1985, Inf. Process. Lett..
[2] Oscar H. Ibarra,et al. On the Control Power of Integer Division , 1983, Theor. Comput. Sci..