State complexity characterizations of parameterized degree-bounded graph connectivity, sub-linear space computation, and the linear space hypothesis (Q5919705): Difference between revisions
From MaRDI portal
Item:Q5919705
Set OpenAlex properties. |
Changed an Item |
||
| Property / arXiv ID | |||
| Property / arXiv ID: 1811.06336 / rank | |||
Normal rank | |||
Revision as of 17:47, 18 April 2024
scientific article; zbMATH DE number 7127846
| Language | Label | Description | Also known as |
|---|---|---|---|
| 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
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
