How much randomness is needed to convert MA protocols to AM protocols?

DOI10.1007/978-3-031-09574-0_21MaRDI QIDQ2097236zbMATH OpenOpenAlexFDO

Authors Nikolai K. Vereshchagin

Publication date 11 November 2022

Full work available at URL https://doi.org/10.1007/978-3-031-09574-0_21

zbMATH Keywords

Arthur-Merlin protocolderandomizationMerlin-Arthur protocoloracles

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites work

• Algebrization: a new barrier in complexity theory
• BPP and the polynomial hierarchy
• Circuit lower bounds for average-case MA
• Derandomized graph products
• Does co-NP have short interactive proofs ?
• Relativizations of the $\mathcal{P} = ?\mathcal{NP}$ Question

This page was built for publication: How much randomness is needed to convert MA protocols to AM protocols?

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