Exact Cover Problem in Milton Babbitt’s All-Partition Array

DOI10.1007/978-3-319-20603-5_25zbMath1320.00015OpenAlexW1771686668MaRDI QIDQ2942336

Brian Bemman, David Meredith

Publication date: 20 August 2015

Published in: Mathematics and Computation in Music (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-20603-5_25

zbMATH Keywords

exact coverBabbittall-partition arraycomputational music analysisKnuth

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Combinatorial aspects of packing and covering (05B40) Mathematics and music (00A65)

Related Items (1)

Predicting Babbitt's orderings of time-point classes from array aggregate partitions in None but the Lonely Flute and Around the Horn

Cites Work

• Unnamed Item

This page was built for publication: Exact Cover Problem in Milton Babbitt’s All-Partition Array