Track papers across labs, topics, and trends.
Search papers, labs, and topics across Lattice.
Lehigh University
1
0
0
Continuous relaxations can be strictly harder than discrete optimization: box-constrained quadratic programming collapses into strong NP-hardness at treewidth two, breaking the universal bounded-treewidth tractability enjoyed by binary QPs.