Complexity theory of parallel time and hardware

Information and Computation

Volumn 80, Issue 3, 1989, Pages 205-226

  Dymond, Patrick W ^a   Cook, Stephen A ^a  

^a UNIVERSITY OF TORONTO   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER HARDWARE; COMPUTER METATHEORY--EQUIVALENCE CLASSES; COMPUTER SYSTEMS, DIGITAL--PARALLEL PROCESSING;

COMPLEXITY OF ALGORITHMS;

AUTOMATA THEORY;

EID: 0024626755     PISSN: 08905401     EISSN: 10902651     Source Type: Journal    
DOI: 10.1016/0890-5401(89)90009-6     Document Type: Article

References (38)

1. Theory of logical nets
2. On relating time and space to size and depth
3. Alternation
4. Alternation
5. Storage requirements for deterministic polynomial time recognizable languages
6. Characterizations of pushdown machines in terms of time-bounded computers
7. Deterministic CFLs are accepted simultaneously in polynomial time and log squared space
8. Towards a complexity theory of synchronous parallel computation
9. Simultaneous Resource Bounds and Parallel Computation
10. Hardware complexity and parallel computation
11. Parallelism in random access machines
12. Synchronous Parallel Computation
13. A universal interconnection pattern for parallel computers
14. A space efficient algorithm for the monotone planar circuit value problem
15. Tape reversal bounded Turing machine computations
16. The similarity and duality of computation
17. A trade-off theorem for space and reversal
18. Some Topics in Circuit Complexity
19. Parallel prefix computation
20. Asymptotically tight bounds on time-space tradeoffs in a pebble game
21. On the algorithmic complexity of discrete functions
22. A universal automation
23. A relationship between machine time-complexity and network gate complexity
24. On simultaneous resource bounds
25. Comparative schematology and pebbling with auxiliary pushdowns
26. The CRAY-1 computer system
27. Tree-size bounded alternation
28. On uniform circuit complexity
29. Time bounded random access machines with parallel processing
30. Relations between nondeterministic and deterministic tape complexities
31. Parallel and nondeterministic complexity classes
32. Storage modification machines
33. The network complexity and the Turing machine complexity of finite functions
34. The complexity of Parallel Computations