Logspace Hierarchies, Polynomial Time and the Complexity of Fairness Problems Concerning $\omega $-Machines (Q3779740)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Logspace Hierarchies, Polynomial Time and the Complexity of Fairness Problems Concerning \omega -Machines |
scientific article; zbMATH DE number 4041259
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Logspace Hierarchies, Polynomial Time and the Complexity of Fairness Problems Concerning $\omega $-Machines |
scientific article; zbMATH DE number 4041259 |
Statements
Logspace Hierarchies, Polynomial Time and the Complexity of Fairness Problems Concerning $\omega $-Machines (English)
0 references
1987
0 references
computational complexity
0 references
space oracle hierarchy
0 references
complete problems
0 references
finite automata
0 references
\(\omega \)-automata
0 references
alternating logspace hierarchy
0 references
oracle Turing machines
0 references
logspace alternation hierarchy
0 references
0.9452162384986876
0 references
0.7601056694984436
0 references
0.7540827393531799
0 references
