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

Topological Lower Bounds on Algebraic Random Access Machines

โœ Scribed by Ben-Amram, Amir M.; Galil, Zvi

Book ID
118180456
Publisher
Society for Industrial and Applied Mathematics
Year
2001
Tongue
English
Weight
368 KB
Volume
31
Category
Article
ISSN
0097-5397

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

A lower time bound for the knapsack prob
A lower time bound for the knapsack problem on random access machines
โœ Peter Klein; Friedhelm Meyer Heide ๐Ÿ“‚ Article ๐Ÿ“… 1983 ๐Ÿ› Springer-Verlag ๐ŸŒ English โš– 533 KB

a.M. (Fed. Rep.) Summary. We consider random access machines which read the input integer by integer (not bit by bit). For this computational model we prove a quadratic lower bound for the n-dimensional knapsack problem. For this purpose, we combine a method due to Paul and Simon [1] to apply decisi

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