Some considerations about NPRIORITY(1) without ROM (Q1113673)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 4080925
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Some considerations about NPRIORITY(1) without ROM |
scientific article; zbMATH DE number 4080925 |
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
0.7768100500106812
0 references
0.7595939636230469
0 references
0.7584699392318726
0 references
0.758432149887085
0 references
