One-time nondeterministic computations (Q5205043)
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 7141924
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | One-time nondeterministic computations |
scientific article; zbMATH DE number 7141924 |
Statements
One-Time Nondeterministic Computations (English)
0 references
10 December 2019
0 references
descriptional complexity
0 references
limited nondeterminism
0 references
nondeterministic finite automata
0 references
nondeterministic pushdown automata
0 references
recursive and nonrecursive trade-offs
0 references
0.9977954030036926
0 references
0.7316465377807617
0 references
0.7284879088401794
0 references
0.7238895297050476
0 references
