Stanislav Zivny
where else to find them
no profile links on file
what they talk about
their talks carry no tags yet
where they keep going back
no series more than once — all 2 in the filters
on a stage with
never shared a talk
who talks about the same things
nobody close enough yet
| title | conference | date |
|---|---|---|
| Power and Limits of LP and SDP Relaxations | Symmetry, Logic, Computation 2016 | 2016-11-07 |
For any finite valued-CSP language the result gives a precise dichotomy: if the language’s fractional polymorphism support satisfies the bounded width… | ||
| LP Relaxations for Valued CSPs | The Classification Program of Counting Complexity | 2016-03-28 |
Gives an exact algebraic characterization of when linear-program relaxations solve valued CSPs: the basic LP (BLP) or a bounded Sherali–Adams level is tight… | ||
| nothing matches | ||