๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Lower Bounds in a Parallel Model without Bit Operations

โœ Scribed by Mulmuley, Ketan


Book ID
118177422
Publisher
Society for Industrial and Applied Mathematics
Year
1999
Tongue
English
Weight
634 KB
Volume
28
Category
Article
ISSN
0097-5397

No coin nor oath required. For personal study only.


๐Ÿ“œ SIMILAR VOLUMES


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