arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1607.04220cs.CC
收藏

编曲的计算复杂性

Computational Complexity of Arranging Music

William S. Moses, Erik D. Demaine

摘要:

本文证明了当受到各种约束时,音乐的编排是NP难的:避免音乐不和谐,限制可以同时演奏多少个音符,限制和弦之间的过渡速度。这些结果暗示了相关音乐问题的计算复杂性,包括音乐舞蹈和节奏游戏。

英文摘要:

This paper proves that arrangement of music is NP-hard when subject to various constraints: avoiding musical dissonance, limiting how many notes can be played simultaneously, and limiting transition speed between chords. These results imply the computational complexity of related musical problems, including musical choreography and rhythm games.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑