The Distributed Complexity of Locally Checkable Problems on Paths is Decidable (Q5145218)
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 7298685
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The Distributed Complexity of Locally Checkable Problems on Paths is Decidable |
scientific article; zbMATH DE number 7298685 |
Statements
The Distributed Complexity of Locally Checkable Problems on Paths is Decidable (English)
0 references
20 January 2021
0 references
complexity
0 references
decidability
0 references
distributed computing
0 references
0.8117619752883911
0 references
0.7956592440605164
0 references
0.7915520668029785
0 references
0.7914411425590515
0 references
0.7722548246383667
0 references
