If the Current Clique Algorithms are Optimal, So is Valiant's Parser

Article Details
Title:	If the Current Clique Algorithms are Optimal, So is Valiant's Parser
Article URLs:	https://doi.org/10.1109/FOCS.2015.16 http://doi.ieeecomputersociety.org/10.1109/FOCS.2015.16
Alternative Article URLs:
Authors:	Amir Abboud	Stanford University, Computer Science Department
	Arturs Backurs	MIT, EECS
	Virginia Vassilevska Williams	Stanford University, Computer Science Department
Sharing:	Unknown
Verification:	Authors have not verified information
Artifact Evaluation Badge:	none
Artifact URLs:
Artifact Correspondence Email Addresses:
NSF Award Numbers:	1417238, 1514339
DBLP Key:	conf/focs/AbboudBW15a
Author Comments:

IEEE Foundations of Computer Science, FOCS 2015