A note on PCP vs. MIP
From MaRDI portal
Publication:1350618
DOI10.1016/0020-0190(96)00043-9zbMath0875.68428OpenAlexW2160227905WikidataQ62398509 ScholiaQ62398509MaRDI QIDQ1350618
Publication date: 27 February 1997
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0020-0190(96)00043-9
Parallel algorithms in computer science (68W10) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)
Related Items (1)
Cites Work
This page was built for publication: A note on PCP vs. MIP