4 papers
Ineffectiveness for Search and Undecidability of PCSP Meta-Problems
Alberto Larrauri
It is an open question whether the search and decision versions of promise CSPs are equivalent. Most known algorithms for PCSPs solve only their \emph{decision} variant, and it is…
Equations over Finite Monoids with Infinite Promises
Alberto Larrauri, Antoine Mottet, Stanislav Živný +1
Larrauri and Živný [ICALP'25/ACM ToCL'24] recently established a complete complexity classification of the problem of solving a system of equations over a monoid assuming that…
Optimal Inapproximability of Promise Equations over Finite Groups
Silvia Butti, Alberto Larrauri, Stanislav Živný
A celebrated result of Hastad established that, for any constant , it is NP-hard to find an assignment satisfying a -fraction of the constraints…
Convergence Laws for Extensions of First-Order Logic with Averaging
Sam Adam-Day, Michael Benedikt, Alberto Larrauri
For many standard models of random structure, first-order logic sentences exhibit a convergence phenomenon on random inputs. The most well-known example is for random graphs with c…