8 citations · 8 across the 1 of their papers we have counts for
3 papers
cs.CC2021★ 8 cited
Beyond PCSP (1-in-3,NAE)
Alex Brandts, Stanislav Živný
The promise constraint satisfaction problem (PCSP) is a recently introduced vast generalisation of the constraint satisfaction problem (CSP) that captures approximability of satisf…
cs.DM2019
The complexity of promise SAT on non-Boolean domains
Alex Brandts, Marcin Wrochna, Stanislav Živný
While 3-SAT is NP-hard, 2-SAT is solvable in polynomial time. Austrin, Guruswami, and Håstad roved a result known as "-SAT is NP-hard" [FOCS'14/SICOMP'17]. They sh…
math.GT2017
Volumes of hyperbolic three-manifolds associated to modular links
Alex Brandts, Tali Pinsky, Lior Silberman
Periodic geodesics on the modular surface correspond to periodic orbits of the geodesic flow in its unit tangent bundle $\mathrm{PSL}_2(\mathbb{Z})\backslash\mathrm{PSL}_2(\mathbb{…