One-Shot Learning for k-SAT
International Colloquium on Automata, Languages and Programming (ICALP), 2025
Main:15 Pages
Bibliography:4 Pages
Abstract
Consider a -SAT formula where every variable appears at most times, and let be a satisfying assignment of sampled proportionally to where is the number of variables set to true and is a real parameter. Given and , can we learn the value of efficiently?
View on arXivComments on this paper
