On the parallel complexity of loops
type: Item
instance of: scholarly article
title: On the parallel complexity of loops
zbMATH Open document ID: 0901.68071
DOI: 10.1016/S0304-3975(96)00184-3
author: Oscar H. Ibarra
author: Nicholas Q. Tran
author: Tao Yang
published in: Theoretical Computer Science
publication date: 1998-07-22T00:00:00Z
Mathematics Subject Classification ID: 68Q15
zbMATH DE Number: 1178213
zbMATH Keywords: PRAM complexity theory
MaRDI profile type: Publication
cites work: Alternation
cites work: A taxonomy of problems with fast parallel algorithms
cites work: Q3862379
cites work: Q4713370
cites work: Some classes of languages in \(NC^ 1\)
cites work: Nondeterministic Space is Closed under Complementation
cites work: Q4023519
cites work: Complete problems for deterministic polynomial time
cites work: Q3994749
cites work: On uniform circuit complexity
cites work: On tape-bounded complexity classes and multihead finite automata
cites work: An extension of Savitch's theorem to small space bounds
cites work: Parallel complexity of logical query programs
cites work: Efficient recognition of rational relations
cites work: Q4040908
full work available at URL: s0304-3975(96)00184-3
OpenAlex ID: W1971445235
description: scientific article; zbMATH DE number 1178213