Speedups of deterministic machines by synchronous parallel machines

Authors:
Patrick W. Dymond;Martin Tompa
Affiliations:
-;-
Venue:
STOC '83 Proceedings of the fifteenth annual ACM symposium on Theory of computing
Year:
1983

Citing 6
Cited 1

On Time Versus Space

Journal of the ACM (JACM)
Alternation

Journal of the ACM (JACM)
Parallel and Nondeterministic Time Complexity Classes (Preliminary Report)

Proceedings of the Fifth Colloquium on Automata, Languages and Programming
On the Power of Probabilistic Choice in Synchronous Parallel Computations

Proceedings of the 9th Colloquium on Automata, Languages and Programming
A unified approach to models of synchronous parallel machines

STOC '78 Proceedings of the tenth annual ACM symposium on Theory of computing
Parallelism in random access machines

STOC '78 Proceedings of the tenth annual ACM symposium on Theory of computing

Fast reductions from RAMs to delegatable succinct constraint satisfaction problems: extended abstract

Proceedings of the 4th conference on Innovations in Theoretical Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper presents the new speedups DTIME(T) @@@@ ATIME(T/log T) and DTIME(T) @@@@ PRAM-Time(@@@@T). These improve the results of Hopcroft, Paul, and Valiant that DTIME(T) @@@@ DSPACE(T/log T), and of Paul and Reischuk that DTIME(T) @@@@ ATIME(T log log T/log T). The new approach unifies not only these two previous results, but also the result of Paterson and Valiant that Size(T) @@@@ Depth(O(T/log T)).