On the parallel complexity of loops

DOI10.1016/S0304-3975(96)00184-3zbMath0901.68071OpenAlexW1971445235MaRDI QIDQ1391751

Tao Yang, Nicholas Q. Tran, Oscar H. Ibarra

Publication date: 22 July 1998

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0304-3975(96)00184-3

zbMATH Keywords

PRAM complexity theory

Mathematics Subject Classification ID

Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Some classes of languages in \(NC^ 1\)
• Parallel complexity of logical query programs
• An extension of Savitch's theorem to small space bounds
• On uniform circuit complexity
• Efficient recognition of rational relations
• On tape-bounded complexity classes and multihead finite automata
• Complete problems for deterministic polynomial time
• A taxonomy of problems with fast parallel algorithms
• Nondeterministic Space is Closed under Complementation
• Alternation

This page was built for publication: On the parallel complexity of loops