Exact Cover Problem in Milton Babbitt's All-partition Array

Publikation: Bidrag til bog/antologi/rapport/konference proceedingBidrag til bog/antologiForskningpeer review

4 Citationer (Scopus)

Abstrakt

One aspect of analyzing Milton Babbitt’s (1916–2011) all- partition arrays requires finding a sequence of distinct, non-overlapping aggregate regions that completely and exactly covers an irregular matrix of pitch class integers. This is an example of the so-called exact cover problem. Given a set, A, and a collection of distinct subsets of this set, S, then a subset of S is an exact cover of A if it exhaustively and exclu- sively partitions A. We provide a backtracking algorithm for solving this problem in an all-partition array and compare the output of this algorithm with an analysis produced manually.
OriginalsprogEngelsk
TitelMathematics and Computation in Music : 5th International Conference, MCM 2015, London, UK, June 22-25, 2015, Proceedings
RedaktørerTom Collins, David Meredith, Anja Volk
Antal sider6
UdgivelsesstedCham, Switzerland
ForlagSpringer
Publikationsdato2015
Sider237-242
ISBN (Trykt) 978-3-319-20602-8
ISBN (Elektronisk)978-3-319-20603-5
DOI
StatusUdgivet - 2015
BegivenhedFifth Biennial International Conference on Mathematics and Computation in Music - Queen Mary University of London, London, Storbritannien
Varighed: 22 jun. 201525 jun. 2015
Konferencens nummer: 5

Konference

KonferenceFifth Biennial International Conference on Mathematics and Computation in Music
Nummer5
LokationQueen Mary University of London
LandStorbritannien
ByLondon
Periode22/06/201525/06/2015
NavnLecture Notes in Computer Science
Vol/bind9110
ISSN0302-9743

Fingeraftryk Dyk ned i forskningsemnerne om 'Exact Cover Problem in Milton Babbitt's All-partition Array'. Sammen danner de et unikt fingeraftryk.

Citationsformater