Beating Brute Force for Systems of Polynomial Equations over Finite Fields

Article Details
Title:	Beating Brute Force for Systems of Polynomial Equations over Finite Fields
Article URLs:	https://doi.org/10.1137/1.9781611974782.143 http://dl.acm.org/citation.cfm?id=3039829
Alternative Article URLs:
Authors:	Daniel Lokshtanov	University of Bergen
	Ramamohan Paturi	University of California - San Diego
	Suguru Tamaki	Kyoto University
	R. Ryan Williams	Stanford University
	Huacheng Yu	Stanford University
Sharing:	Unknown
Verification:	Authors have not verified information
Artifact Evaluation Badge:	none
Artifact URLs:
Artifact Correspondence Email Addresses:
NSF Award Numbers:	1213151, 1212372, 1552651
DBLP Key:	conf/soda/LokshtanovPTWY17
Author Comments:

ACM Symposium on Discrete Algorithms, SODA 2017