Some considerations about NPRIORITY(1) without ROM (Q1113673): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Removed claim: reviewed by (P1447): Item:Q705547 |
||
| Property / reviewed by | |||
| Property / reviewed by: Michael Clausen / rank | |||
Revision as of 11:12, 20 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Some considerations about NPRIORITY(1) without ROM |
scientific article |
Statements
Some considerations about NPRIORITY(1) without ROM (English)
0 references
1988
0 references
This article observes some computational time bounds on a kind of a nondeterministic CRCW PRAM. In particular the authors prove that nondeteministic one-way pushdown automata can be simulated by nondeterministic PRIORITY(1)'s without ROM in O(\(\sqrt{n})\) time. This time bound is tight.
0 references
complexity
0 references
parallel computation
0 references
k-sensitive everywhere function
0 references
nondeterministic CRCW PRAM
0 references
nondeteministic one-way pushdown automata
0 references
