Lower Bounds for the Complexity of Funct
✍
Nader H. Bshouty
📂
Article
📅
1999
🏛
Elsevier Science
🌐
English
⚖ 127 KB
This paper develops a new technique that finds almost tight lower bounds for the complexity of programs that compute or approximate functions in a realistic RAM model. The nonuniform realistic RAM model is a model that uses the arithmetic Ä 4 operations q, y, = , the standard bit operation Shift, Ro