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...

Fuld beskrivelse

Bibliografiske detaljer
Main Authors: Scott, A, Sorkin, G
Format: Journal article
Sprog:English
Udgivet: 2009