Revisiting Maximum Satisfiability and Related Problems in Data Streams

Hoa T. Vu

Abstract: We revisit the maximum satisfiability problem (Max-SAT) in the data stream model. In this problem, the stream consists of m clauses that are disjunctions of literals drawn from n Boolean variables. The objective is to find an assignment to the variables that maximizes the number of satisfied clauses. Chou et al. (FOCS 2020) showed that \(\varOmega (\sqrt{n})\) space is necessary to yield a \(\sqrt{2}/2+\varepsilon \) approximation of the optimum value; they also presented an algorithm that yields a \(\sqrt{2}/2-\varepsilon \) approximation of the optimum value using \(O(\varepsilon ^{-2}\log n)\) space.