Chip-firing games on Eulerian digraphs and NP-hardness of computing the rank of a divisor on a graph (Q2354726)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Chip-firing games on Eulerian digraphs and NP-hardness of computing the rank of a divisor on a graph |
scientific article |
Statements
Chip-firing games on Eulerian digraphs and NP-hardness of computing the rank of a divisor on a graph (English)
0 references
24 July 2015
0 references
chip-firing game
0 references
Riemann-Roch theory
0 references
computational complexity
0 references
Eulerian graph
0 references
0 references
