Andreas Galanis

activity

20242026

collaborators

Showing cs.DSShow all

2 papers · 1 filter

cs.DS2025

One-Shot Learning for k-SAT

Andreas Galanis, Leslie Ann Goldberg, Xusheng Zhang

Consider a $k$ -SAT formula $I^¦$ where every variable appears at most $d$ times. Let $I ¨ $ be a satisfying assignment, sampled proportionally to $e^{I^^{2} m (I ¨ )}$ where $m (I ¨ )$ is the nu…

cs.DS2024

Fast sampling of satisfying assignments from random $k$ -SAT with applications to connectivity

Zongchen Chen, Andreas Galanis, Leslie Ann Goldberg +4

We give a nearly linear-time algorithm to approximately sample satisfying assignments in the random $k$ -SAT model when the density of the formula scales exponentially with $k$ . The…

One-Shot Learning for k-SAT

Fast sampling of satisfying assignments from random k-SAT with applications to connectivity

Fast sampling of satisfying assignments from random $k$ -SAT with applications to connectivity