欧拉有向图上的炸片博弈及计算图上因子秩的NP-困难性
Chip-firing games on Eulerian digraphs and NP-hardness of computing the rank of a divisor on a graph
摘要：
Baker和Norine介绍了Riemann-Roch理论的图论模拟。这个理论的一个中心概念是除数的秩。在本文中，我们证明了计算图上的因子的秩是NP-困难的。除数的秩的确定可以转化为关于在相同的底层图上的筹码射击游戏的问题。我们证明了NP-困难的这个问题有关芯片发射有向和无向图。
英文摘要：
Baker and Norine introduced a graph-theoretic analogue of the Riemann-Roch theory. A central notion in this theory is the rank of a divisor. In this paper we prove that computing the rank of a divisor on a graph is NP-hard. The determination of the rank of a divisor can be translated to a question about a chip-firing game on the same underlying graph. We prove the NP-hardness of this question by relating chip-firing on directed and undirected graphs.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
