4 citations · 4 across the 6 of their papers we have counts for
Showing 2021Show all
3 papers · 1 filter
math.OC2021
A Semidefinite Framework for the Sieve
Zarathustra Brady
We describe a semidefinite programming framework for proving upper bounds on concrete sifting problems, and show that the Large Sieve can be interpreted as a special case of this f…
cs.CC2021
Unifying the Three Algebraic Approaches to the CSP via Minimal Taylor Algebras
Libor Barto, Zarathustra Brady, Andrei Bulatov +2
This paper focuses on the algebraic theory underlying the study of the complexity and the algorithms for the Constraint Satisfaction Problem (CSP). We unify, simplify, and extend p…
math.RA2021
Symmetric Operations on Domains of Size at Most 4
Zarathustra Brady, Holden Mui
To convert a fractional solution to an instance of a constraint satisfaction problem into a solution, a rounding scheme is needed, which can be described by a collection of symmetr…