Some considerations about NPRIORITY(1) without ROM

DOI10.1016/0020-0190(88)90212-8zbMath0661.68056OpenAlexW2081905436MaRDI QIDQ1113673

Itsuo Takanami, Katsushi Inoue

Publication date: 1988

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(88)90212-8

zbMATH Keywords

complexityparallel computationk-sensitive everywhere functionnondeteministic one-way pushdown automatanondeterministic CRCW PRAM

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Formal languages and automata (68Q45)

Cites Work

• Unnamed Item
• Separation and lower bounds for ROM and nondeterministic models of parallel computation
• Trade-Offs between Depth and Width in Parallel Computation
• Quasi-realtime languages

This page was built for publication: Some considerations about NPRIORITY(1) without ROM