8 citations · 9 across the 3 of their papers we have counts for
1 paper · 1 filter
Petr Kolman, Martin Koutecký
In this paper we provide an extended formulation for the class of constraint satisfaction problems and prove that its size is polynomial for instances whose constraint graph has bo…