Polynomial Constraint Satisfaction Problems, Graph Bisection, and the Ising Partition Function

We introduce a problem classwecall Polynomial Constraint Satisfaction Problems, orPCSP. Where the usual CSPs from computer science and optimization have real-valued score functions, and partition functions from physics have monomials, PCSP has scores that are arbitrary multivariate formal polynomial...

Descrizione completa

Dettagli Bibliografici
Autori principali: Scott, A, Sorkin, G
Natura: Journal article
Lingua:English
Pubblicazione: 2009