Probabilistic Polynomials and Hamming Nearest Neighbors

Article Details
Title:	Probabilistic Polynomials and Hamming Nearest Neighbors
Article URLs:	https://doi.org/10.1109/FOCS.2015.18 http://doi.ieeecomputersociety.org/10.1109/FOCS.2015.18
Alternative Article URLs:
Authors:	Josh Alman	Stanford University, Computer Science Department
Authors:	Ryan 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:	1212372, 114747
DBLP Key:	conf/focs/AlmanW15
Author Comments:

IEEE Foundations of Computer Science, FOCS 2015