Hardness of approximation for stochastic problems via interactive oracle proofs

DOI10.4230/LIPICS.CCC.2022.24MaRDI QIDQ6568367zbMATH OpenFDO

Authors Gal Arnon, Alessandro Chiesa, Eylon Yogev

Publication date 5 July 2024

zbMATH Keywords

hardness of approximationinteractive oracle proofsstochastic satisfaction problems

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

This page was built for publication: Hardness of approximation for stochastic problems via interactive oracle proofs

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