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

Parallel random access machines with bounded memory wordsize

โœ Scribed by Stephen J. Bellantoni

Book ID
113383994
Publisher
Elsevier Science
Year
1991
Tongue
English
Weight
941 KB
Volume
91
Category
Article
ISSN
0890-5401

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Time bounded random access machines
Time bounded random access machines
โœ Stephen A. Cook; Robert A. Reckhow ๐Ÿ“‚ Article ๐Ÿ“… 1973 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 943 KB

model for a random access computer, is introduced. A unique feature of the model is that the execution time of an instruction is defined in terms of l(n), a function of the size of the numbers manipulated by the instruction. This model has a fixed program, but it is shown that the computing speeds o

Transforming comparison model lower boun
Transforming comparison model lower bounds to the parallel-random-access-machine
โœ Dany Breslauer; Artur Czumaj; Devdatt P. Dubhashi; Friedhelm Meyer auf der Heide ๐Ÿ“‚ Article ๐Ÿ“… 1997 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 758 KB

We provide general transformations of lower bounds in Valiant's parallel-comparison-decision-tree model to lower bounds in the priority concurrent-read concurrent-write parallel-random-access-machine model. The proofs rely on standard Ramsey-theoretic arguments that simplify the structure of the com