1 paper · 1 filter
Joshua Brakensiek, Aaron Putterman, Amatya Sharma +1
We study the one-pass streaming complexity of CSPs over a fixed finite relation R under three natural objectives: SAT(R), deciding whether all constraints can be satis…