NDLI: Dense Subsets of Pseudorandom Sets

Content Provider	IEEE Xplore Digital Library
Author	Reingold, O. Trevisan, L. Tulsiani, M. Vadhan, S.
Copyright Year	2008
Abstract	A theorem of Green, Tao, and Ziegler can be stated (roughly) as follows: ifR is a pseudorandom set, and D is a dense subset of R, then D may be modeled by a set M that is dense in the entire domain such that D and M are indistinguishable. (The precise statement refers to"measures" or distributions rather than sets.) The proof of this theorem is very general, and it applies to notions of pseudo-randomness and indistinguishability defined in terms of any family of distinguishers with some mild closure properties. The proof proceeds via iterative partitioning and an energy increment argument, in the spirit of the proof of the weak Szemeredi regularity lemma. The "reduction" involved in the proof has exponential complexity in the distinguishing probability. We present a new proof inspired by Nisan's proof of Impagliazzo's hardcore set theorem. The reduction in our proof has polynomial complexity in the distinguishing probability and provides a new characterization of the notion of "pseudoentropy" of a distribution. A proof similar to ours has also been independently discovered by Gowers [2]. We also follow the connection between the two theorems and obtain a new proof of Impagliazzo's hardcore set theorem via iterative partitioning and energy increment. While our reduction has exponential complexity in some parameters, it has the advantage that the hardcore set is efficiently recognizable.
Starting Page	76
Ending Page	85
File Size	363665
Page Count	10
File Format	PDF
ISBN	9780769534367
ISSN	02725428
DOI	10.1109/FOCS.2008.38
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	2008-10-25
Publisher Place	USA
Access Restriction	Subscribed
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	Arithmetic Polynomials Complexity theory Cryptography Additives Combinatorial mathematics Computer science Research and development pseudoentropy pseudorandomness additive combinatorics regularity lemmas
Content Type	Text
Resource Type	Article

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

Regularity, Boosting, and Efficiently Simulating Every High-Entropy Distribution

Characterizing pseudoentropy and simplifying pseudorandom generator constructions

Structure and Randomness in Complexity Theory and Additive Combinatorics

Permutation polynomials induced from permutations of subfields, and some complete sets of mutually orthogonal latin squares

Groups and Combinatorial Number Theory

A note on the instance complexity of pseudorandom sets

Sets of natural numbers with proscribed subsets

Pseudorandomness and Combinatorial Constructions

An Additive Combinatorics Approach Relating Rank to Communication Complexity

Dense Subsets of Pseudorandom Sets

Similar Documents

Regularity, Boosting, and Efficiently Simulating Every High-Entropy Distribution

Characterizing pseudoentropy and simplifying pseudorandom generator constructions

Structure and Randomness in Complexity Theory and Additive Combinatorics

Permutation polynomials induced from permutations of subfields, and some complete sets of mutually orthogonal latin squares

Groups and Combinatorial Number Theory

A note on the instance complexity of pseudorandom sets

Sets of natural numbers with proscribed subsets

Pseudorandomness and Combinatorial Constructions

An Additive Combinatorics Approach Relating Rank to Communication Complexity

Dense Subsets of Pseudorandom Sets