Rotor-routing reachability is easy, chip-firing reachability is hard (Q2066002)
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 7456673
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Rotor-routing reachability is easy, chip-firing reachability is hard |
scientific article; zbMATH DE number 7456673 |
Statements
Rotor-routing reachability is easy, chip-firing reachability is hard (English)
0 references
13 January 2022
0 references
rotor-routing reachability problem
0 references
0.8938512206077576
0 references
0.8086680173873901
0 references
0.7971217632293701
0 references
0.7971217632293701
0 references
0.7893372178077698
0 references
