Amir Abboud, Aviad Rubinstein, R. Ryan Williams. Distributed PCP Theorems for Hardness of Approximation in P. In Chris Umans, editor, 58th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2017, Berkeley, CA, USA, October 15-17, 2017. pages 25-36, IEEE Computer Society, 2017. [doi]
@inproceedings{AbboudRW17,
title = {Distributed PCP Theorems for Hardness of Approximation in P},
author = {Amir Abboud and Aviad Rubinstein and R. Ryan Williams},
year = {2017},
doi = {10.1109/FOCS.2017.12},
url = {https://doi.org/10.1109/FOCS.2017.12},
researchr = {https://researchr.org/publication/AbboudRW17},
cites = {0},
citedby = {0},
pages = {25-36},
booktitle = {58th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2017, Berkeley, CA, USA, October 15-17, 2017},
editor = {Chris Umans},
publisher = {IEEE Computer Society},
isbn = {978-1-5386-3464-6},
}