Distributed PCP Theorems for Hardness of Approximation in P

Article Details
Title:	Distributed PCP Theorems for Hardness of Approximation in P
Article URLs:	https://doi.org/10.1109/FOCS.2017.12 http://doi.ieeecomputersociety.org/10.1109/FOCS.2017.12
Alternative Article URLs:
Authors:	Amir Abboud	Stanford University, Computer Science Department
	Aviad Rubinstein	UC Berkeley, EECS
	R. Ryan Williams	MIT, CSAIL MIT, EECS
Sharing:	Unknown
Verification:	Authors have not verified information
Artifact Evaluation Badge:	none
Artifact URLs:
Artifact Correspondence Email Addresses:
NSF Award Numbers:	1417238, 1528078, 1514339, 1408635, 1741615
DBLP Key:	conf/focs/AbboudRW17
Author Comments:

IEEE Foundations of Computer Science, FOCS 2017