Computational Complexity of Arranging Music

Erik D. Demaine; William S. Moses; Ron Graham

doi:10.2307/j.ctt1s4773q.23

Computational Complexity of Arranging Music

Erik D. Demaine, William S. Moses, Ron Graham

Research output: Chapter in Book/Report/Conference proceeding › Chapter

Abstract

Music has long been an interesting subject of analysis for mathematicians and has led to many interesting questions in music theory and other fields. For the most part, computer scientists have looked into applying artificial intelligence to music [4] and finding algorithms and data structures to solve various musical problems. Prior work on these algorithms often involved computing various musical properties, such as the edit distance between two songs [5] or the optimal fingering [2]. These problems tend to be solvable in polynomial time using dynamic programming and have various applications, such as the music identification service Shazam [6] or

Original language	English (US)
Title of host publication	The Mathematics of Various Entertaining Subjects: Research in Games, Graphs, Counting, and Complexity
Editors	Jennifer Beineke, Jason Rosenhouse
Publisher	Princeton University Press
Pages	364-378
Number of pages	15
Volume	2
ISBN (Electronic)	9781400889136
ISBN (Print)	9780691171920
DOIs	https://doi.org/10.2307/j.ctt1s4773q.23
State	Published - Sep 2017
Externally published	Yes

Online availability

10.2307/j.ctt1s4773q.23

Library availability

Discover UIUC Full Text

Cite this

@inbook{6af6571554ca4caaa22d7d2f147cadb0,

title = "Computational Complexity of Arranging Music",

abstract = "Music has long been an interesting subject of analysis for mathematicians and has led to many interesting questions in music theory and other fields. For the most part, computer scientists have looked into applying artificial intelligence to music [4] and finding algorithms and data structures to solve various musical problems. Prior work on these algorithms often involved computing various musical properties, such as the edit distance between two songs [5] or the optimal fingering [2]. These problems tend to be solvable in polynomial time using dynamic programming and have various applications, such as the music identification service Shazam [6] or",

author = "Demaine, {Erik D.} and Moses, {William S.} and Ron Graham",

year = "2017",

month = sep,

doi = "10.2307/j.ctt1s4773q.23",

language = "English (US)",

isbn = "9780691171920",

volume = "2",

pages = "364--378",

editor = "Jennifer Beineke and Jason Rosenhouse",

booktitle = "The Mathematics of Various Entertaining Subjects: Research in Games, Graphs, Counting, and Complexity",

publisher = "Princeton University Press",

address = "United States",

}

TY - CHAP

T1 - Computational Complexity of Arranging Music

AU - Demaine, Erik D.

AU - Moses, William S.

AU - Graham, Ron

PY - 2017/9

Y1 - 2017/9

N2 - Music has long been an interesting subject of analysis for mathematicians and has led to many interesting questions in music theory and other fields. For the most part, computer scientists have looked into applying artificial intelligence to music [4] and finding algorithms and data structures to solve various musical problems. Prior work on these algorithms often involved computing various musical properties, such as the edit distance between two songs [5] or the optimal fingering [2]. These problems tend to be solvable in polynomial time using dynamic programming and have various applications, such as the music identification service Shazam [6] or

AB - Music has long been an interesting subject of analysis for mathematicians and has led to many interesting questions in music theory and other fields. For the most part, computer scientists have looked into applying artificial intelligence to music [4] and finding algorithms and data structures to solve various musical problems. Prior work on these algorithms often involved computing various musical properties, such as the edit distance between two songs [5] or the optimal fingering [2]. These problems tend to be solvable in polynomial time using dynamic programming and have various applications, such as the music identification service Shazam [6] or

UR - http://www.scopus.com/inward/record.url?scp=85099249700&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85099249700&partnerID=8YFLogxK

U2 - 10.2307/j.ctt1s4773q.23

DO - 10.2307/j.ctt1s4773q.23

M3 - Chapter

SN - 9780691171920

VL - 2

SP - 364

EP - 378

BT - The Mathematics of Various Entertaining Subjects: Research in Games, Graphs, Counting, and Complexity

A2 - Beineke, Jennifer

A2 - Rosenhouse, Jason

PB - Princeton University Press

ER -

Computational Complexity of Arranging Music

Abstract

Online availability

Library availability

Related links

Fingerprint

Cite this