203 citations · 470 across the 96 of their papers we have counts for
Showing 2006Show all
2 papers · 1 filter
cs.DM2006★ 2 cited
Linear-programming design and analysis of fast algorithms for Max 2-Sat and Max 2-CSP
Alexander D. Scott, Gregory B. Sorkin
The class -CSP, or simply Max 2-CSP, consists of constraint satisfaction problems with at most two -valued variables per clause. For instances with variables and …
cs.DM2006★ 15 cited
Polynomial Constraint Satisfaction, Graph Bisection, and the Ising Partition Function
Alexander D. Scott, Gregory B. Sorkin
We introduce a problem class we call Polynomial Constraint Satisfaction Problems, or PCSP. Where the usual CSPs from computer science and optimization have real-valued score functi…