Sublinear-time algorithms for \textsc{Max Cut, Max E2Lin}(q), and unique label cover on expanders

DOI10.1137/1.9781611977554.CH180MaRDI QIDQ6538710zbMATH OpenFDO

Authors Pan Peng, Yuichi Yoshida

Publication date 14 May 2024

Full work available at URL https://doi.org/10.1137/1.9781611977554.CH180

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Cited in

(1)

• Worst-case to expander-case reductions: derandomized and generalized

This page was built for publication: Sublinear-time algorithms for \textsc{Max Cut, Max E2Lin}\((q)\), and unique label cover on expanders

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