Lower bounds for the complexity of functions in a realistic RAM model
- 1 January 1992
- book chapter
- Published by Springer Nature
- p. 12-23
Abstract
No abstract availableKeywords
This publication has 13 references indexed in Scilit:
- Lower bounds for computations with the floor operation1989
- On the extended direct sum conjecture1989
- The complexity of approximating the square root1989
- Lower bounds for algebraic computation trees with integer inputs1989
- On the limits of computations with the floor functionInformation and Computation, 1988
- On computations with integer division1988
- Lower bounds for integer greatest common divisor computations1988
- Applications of Ramsey's theorem to decision tree complexityJournal of the ACM, 1985
- On the control power of integer divisionTheoretical Computer Science, 1983
- Lower bounds for algebraic computation trees1983