Oblivious algorithms for the max-kAND problem

DOI10.4230/LIPICS.APPROX/RANDOM.2023.15MaRDI QIDQ6663025zbMATH OpenFDO

Authors Noah Singer

Publication date 14 January 2025

Full work available at URL https://doi.org/10.4230/LIPICS.APPROX/RANDOM.2023.15

zbMATH Keywords

approximation algorithmconstraint satisfaction problem (CSP)factor-revealing linear programstreaming algorithm

Mathematics Subject Classification ID

Randomized algorithms (68W20) Approximation algorithms (68W25) Combinatorial optimization (90C27)

Cited in

(1)

• Sketching approximability of all finite CSPs

This page was built for publication: Oblivious algorithms for the max-\(k\)AND problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6663025)