State complexity characterizations of parameterized degree-bounded graph connectivity, sub-linear space computation, and the linear space hypothesis (Q5896095)
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: State complexity characterizations of parameterized degree-bounded graph connectivity, sub-linear space computation, and the linear space hypothesis |
scientific article; zbMATH DE number 7127846
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | State complexity characterizations of parameterized degree-bounded graph connectivity, sub-linear space computation, and the linear space hypothesis |
scientific article; zbMATH DE number 7127846 |
Statements
State complexity characterizations of parameterized degree-bounded graph connectivity, sub-linear space computation, and the linear space hypothesis (English)
0 references
30 June 2020
0 references
7 November 2019
0 references
state complexity
0 references
alternating finite automata
0 references
sub-linear-space computability
0 references
directed graph connectivity problem
0 references
parameterized decision problems
0 references
polynomial-size advice
0 references
linear space hypothesis
0 references
0.998330295085907
0 references
0.7883619070053101
0 references
0.7048096060752869
0 references
0.6930764317512512
0 references
