Some considerations about NPRIORITY(1) without ROM (Q1113673): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| (One intermediate revision by one other user not shown) | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0020-0190(88)90212-8 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2081905436 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Quasi-realtime languages / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q5592246 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Separation and lower bounds for ROM and nondeterministic models of parallel computation / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Trade-Offs between Depth and Width in Parallel Computation / rank | |||
Normal rank | |||
Latest revision as of 11:25, 19 June 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
0 references
