Bitwise Operations under RAMBO

In this paper we study the problem of computing w-bit bitwise operations using only O(1) memory probes. We show that under the RAM model there exists a Omega(2^w) space lower bound while under the ...

[1]  David S. Johnson,et al.  A Catalog of Complexity Classes , 1991, Handbook of Theoretical Computer Science, Volume A: Algorithms and Complexity.

[2]  Richard M. Karp,et al.  Parallel Algorithms for Shared-Memory Machines , 1991, Handbook of Theoretical Computer Science, Volume A: Algorithms and Complexity.

[3]  P. Boas Machine models and simulations , 1991 .

[4]  Stephen A. Cook,et al.  Time Bounded Random Access Machines , 1973, J. Comput. Syst. Sci..

[5]  Ralph P. Grimaldi,et al.  Discrete and Combinatorial Mathematics: An Applied Introduction , 1998 .

[6]  A. Brodnik Searching in constant time and minimum space , 1996 .

[7]  Peter Bro Miltersen,et al.  Static dictionaries on AC/sup 0/ RAMs: query time /spl theta/(/spl radic/log n/log log n) is necessary and sufficient , 1996, Proceedings of 37th Conference on Foundations of Computer Science.

[8]  Johan Karlsson,et al.  Worst case constant time priority queue , 2001, SODA '01.

[9]  Jean-Philippe Rennard,et al.  Implementation of Logical Functions in the Game of Life , 2004, Collision-Based Computing.

[10]  A. G. Hanlon Content-Addressable and Associative Memory Systems a Survey , 1966, IEEE Trans. Electron. Comput..

[11]  I. M. Tsai,et al.  A Systematic Algorithm for Quantum Boolean Circuits Construction , 2001 .

[12]  Ronald L. Rivest,et al.  Introduction to Algorithms , 1990 .

[13]  Jan van Leeuwen,et al.  Handbook of Theoretical Computer Science, Vol. A: Algorithms and Complexity , 1994 .

[14]  Ralph P. Grimaldi Discrete and combinatorial mathematics : an applied introduction 3rd edition / Ralph P. Grimaldi , 1994 .

[15]  Michael E. Saks,et al.  The cell probe complexity of dynamic data structures , 1989, STOC '89.

[16]  Andrew Chi-Chih Yao,et al.  Should Tables Be Sorted? , 1981, JACM.