Track papers across labs, topics, and trends.
Search papers, labs, and topics across Lattice.
Affiliation:
1
0
0
0
It is proved that feasibility and minimum-cost realization are polynomial-time problems for a fixed number of voices with explicit finite note domains and fixed local rules.