Transforming comparison model lower bounds to the parallel-random-access-machine

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 th...

Full description

Saved in:
Bibliographic Details
Published in:Information processing letters 1997-04, Vol.62 (2), p.103-110
Main Authors: Breslauer, Dany, Czumaj, Artur, Dubhashi, Devdatt P., der Heide, Friedhelm Meyer auf
Format: Article
Language:English
Subjects:
Algorithmics. Computability. Computer arithmetics
Applied sciences
Automata. Abstract machines. Turing machines
Comparative analysis
Comparison model
Computer science
control theory
systems
Exact sciences and technology
Information processing
Lower bounds
Mathematical models
PRAM model
Ramsey theory
Studies
Theoretical computing
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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 computation by restricting the input domain. The transformation of comparison model lower bounds, which are usually easier to obtain, to the parallel-random-access-machine, unifies some known lower bounds and gives new lower bounds for several problems.
ISSN:0020-0190
1872-6119
DOI:10.1016/S0020-0190(97)00032-X