Affine extractors over large fields with exponential error

Author(s): Bourgain, J; Dvir, Zeev; Leeman, E

Download

To refer to this page use: http://arks.princeton.edu/ark:/88435/pr19670

Full metadata record

DC Field	Value	Language
dc.contributor.author	Bourgain, J	-
dc.contributor.author	Dvir, Zeev	-
dc.contributor.author	Leeman, E	-
dc.date.accessioned	2018-07-20T15:07:00Z	-
dc.date.available	2018-07-20T15:07:00Z	-
dc.date.issued	2016-12	en_US
dc.identifier.citation	Bourgain, J, Dvir, Z, Leeman, E. (2016). Affine extractors over large fields with exponential error. Computational Complexity, 25 (921 - 931. doi:10.1007/s00037-015-0108-5	en_US
dc.identifier.uri	http://arks.princeton.edu/ark:/88435/pr19670	-
dc.description.abstract	We describe a construction of explicit affine extractors over large finite fields with exponentially small error and linear output length. Our construction relies on a deep theorem of Deligne giving tight estimates for exponential sums over smooth varieties in high dimensions.	en_US
dc.format.extent	921 - 931	en_US
dc.language.iso	en_US	en_US
dc.relation.ispartof	Computational Complexity	en_US
dc.rights	Author's manuscript	en_US
dc.title	Affine extractors over large fields with exponential error	en_US
dc.type	Journal Article	en_US
dc.identifier.doi	doi:10.1007/s00037-015-0108-5	-
dc.date.eissued	2015-09-02	en_US
pu.type.symplectic	http://www.symplectic.co.uk/publications/atom-terms/1.0/journal-article	en_US

Files in This Item:

File	Description	Size	Format
Affine extractors over large fields with exponential error.pdf		118.79 kB	Adobe PDF	View/Download