Reproduce “A New Characterization of Streaming Decidability of Boolean CSPs Under Deletions” on OpenResearch
Turn your favorite coding agents into research agents that review literature, develop hypotheses, and run experiments.
Universal app for Apple silicon and Intel. Requires macOS 11 or later.
About this paper
Aditya Bandekar, Amatya Sharma, Santhoshini Velusamy
The authors show that one-pass strict-turnstile satisfiability for fixed nontrivial Boolean languages has space characterized, up to polylogarithmic factors, by integer capturing degree: the least degree of an integer-coefficient polynomial vanishing exactly on satisfying tuples. For polynomial-length streams, the algorithm uses O_k(n^d polylog n) bits and every algorithm needs Ω_k(n^d/log n) bits, where d is the maximum relation degree.
Summary by alphaXiv.
Tip: change arxiv.org to autoarxiv.org in any arXiv abstract link to open the paper here.