LP Relaxations for Valued CSPs

preview_player
Показать описание
Stanislav Zivny, University of Oxford
The Classification Program of Counting Complexity
  1. Simons Institute
  2. Simons Institute
  3. UC Berkeley
  4. computer science
  5. theory of computing
  6. Counting Complexity and Phase Transitions
Рекомендации по теме
LP Relaxations for 0:40:48

LP Relaxations for Valued CSPs

Standa Zivny: The 0:26:58

Standa Zivny: The Power of Sherali Adams Relaxations for General Valued CSPs

Power and Limits 0:28:57

Power and Limits of LP and SDP Relaxations

Approximate Constraint Satisfaction 0:47:22

Approximate Constraint Satisfaction Requires Large LP Relaxations

Proof Complexity for 0:12:48

Proof Complexity for CSPs || @ CMU || Lecture 21a of CS Theory Toolkit

CP2020 Bounding Linear 0:19:58

CP2020 Bounding Linear Programs by Constraint Propagation: Application to Max-SAT

2019-07-31 Magnus Wahlström, 1:00:22

2019-07-31 Magnus Wahlström, FPT algorithms via LP relaxations

Max Cut with 0:51:31

Max Cut with Linear Programs: Sherali-Adams Strikes Back

Approximating Rectangles by 0:39:03

Approximating Rectangles by Juntas and Weakly-Exponential Lower Bounds for LP Relaxations of CSPs

CSP Approximability: Optimization 0:33:10

CSP Approximability: Optimization and Certification || @ CMU || Lecture 20c of CS Theory Toolkit

Finding Best LP 0:26:10

Finding Best LP Relaxations for Various Cut Problems

Lower bounds on 1:00:38

Lower bounds on the size of semidefinite programming relaxations - Steurer

Alexandr Kazda — 0:59:34

Alexandr Kazda — Minion homomorphisms give reductions for promise valued CSP

Caterina Viola— The 0:43:56

Caterina Viola— The combined basic LP and affine IP relaxation for promise VCSPs on infinite domains...

[Коллоквиум]: Complexity Classifications 1:02:55

[Коллоквиум]: Complexity Classifications of Valued Constraint Satisfaction Problems

010. Valued Constraint 1:13:13

010. Valued Constraint Satisfaction Problems — Vladimir Kolmogorov

Power of Algorithms 1:00:51

Power of Algorithms in Discrete Optimisation (IE Webinar)

STOC24 11 C 0:22:23

STOC24 11 C 2 Semidefinite programming and linear equations vs homomorphism problems

On Approximability of 1:08:26

On Approximability of Satisfiable CSPs

LP/SDP Hierarchies and 1:06:19

LP/SDP Hierarchies and Sum of Squares Proofs 4

On the Subexponential 0:27:06

On the Subexponential Time Complexity of the CSP

Approximating Max Cut 1:19:57

Approximating Max Cut with Subexponential Linear Programs - Tselil Schramm

CP2021 (Trailer) 'Bounds 0:02:01

CP2021 (Trailer) 'Bounds on Weighted CSPs Using Constraint Propagation and Super-Reparametrizat...

Topics in Constraint 1:05:16

Topics in Constraint Satisfaction and Weighted Constraint Satisfaction