Exact cover problem in Milton Babbitt's all-partition array

DOI10.1007/978-3-319-20603-5_25MaRDI QIDQ2942336zbMATH OpenOpenAlexFDO

Authors 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

all-partition arrayBabbittcomputational music analysisexact coverKnuth

Mathematics Subject Classification ID

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

Recommendations

• A Global Constraint for the Exact Cover Problem: Application to Conceptual Clustering
• Combinatorial solution of the partition problem for a discrete set
• Covering a set with arithmetic progressions is NP-complete
• Solving set covering problems of large dimension
• scientific article; zbMATH DE number 4106856

Cites work

• Restricted weighted integer compositions and extended binomial coefficients

Cited in

(1)

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

This page was built for publication: Exact cover problem in Milton Babbitt's all-partition array

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2942336)