Distributed PCP theorems for hardness of approximation in P

DOI10.1109/FOCS.2017.12MaRDI QIDQ6946376zbMATH OpenFDO

Authors Aviad Rubinstein, Amir Abboud, Ryan Williams

Publication date 6 August 2025

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx) Discrete mathematics in relation to computer science (68Rxx) Theory of computing (68Qxx)

This page was built for publication: Distributed PCP theorems for hardness of approximation in P

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