5 citations · 10 across the 6 of their papers we have counts for
Showing 2024Show all
2 papers · 1 filter
cs.CC2024
Limitations of Affine Integer Relaxations for Solving Constraint Satisfaction Problems
Moritz Lichter, Benedikt Pago
We show that various recent algorithms for finite-domain constraint satisfaction problems (CSP), which are based on solving their affine integer relaxations, do not solve all tract…
cs.LO2024★ 4 cited
Choiceless Computation and Symmetry: Limitations of Definability
Benedikt Pago
The search for a logic capturing PTIME is a long standing open problem in finite model theory. One of the most promising candidate logics for this is Choiceless Polynomial Time wit…