NDLI: Randomness vs. time: de-randomization under a uniform assumption

Content Provider	IEEE Xplore Digital Library
Author	Impagliazzo, R. Wigderson, A.
Copyright Year	1998
Description	Author affiliation: Dept. of Comput. Sci., California Univ., San Diego, La Jolla, CA, USA (Impagliazzo, R.)
Abstract	We prove that if BPP/spl ne/EXP, then every problem in BPP can be solved deterministically in subexponential time on almost every input (on every samplable ensemble for infinitely many input sizes). This is the first derandomization result for BPP based on uniform, noncryptographic hardness assumptions. It implies the following gap in the average-instance complexities of problems in BPP: either these complexities are always sub-exponential or they contain arbitrarily large exponential functions. We use a construction of a small "pseudorandom" set of strings from a "hard function" in EXP which is identical to that used in the analogous non-uniform results described previously. However, previous proofs of correctness assume the "hard function" is not in P/poly. They give a non-constructive argument that a circuit distinguishing the pseudo-random strings from truly random strings implies that a similarly-sized circuit exists computing the "hard function". Our main technical contribution is to show that, if the "hard function" has certain properties, then this argument can be made constructive. We then show that, assuming ESP/spl sube/P/poly, there are EXP-complete functions with these properties.
Starting Page	734
Ending Page	743
File Size	210534
Page Count	10
File Format	PDF
ISBN	0818691727
ISSN	02725428
DOI	10.1109/SFCS.1998.743524
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	1998-11-08
Publisher Place	USA
Access Restriction	Subscribed
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	Computer science History Polynomials Cryptography Concrete Algorithm design and analysis Counting circuits
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

2-Source Extractors under Computational Assumptions and Cryptography with Defective Randomness

Randomness vs. Time: De-randomization under a uniform assumption (1998)

Extracting randomness from samplable distributions

In search of an easy witness: exponential time vs. probabilistic polynomial time

De-randomizing BPP: the state of the art

Extracting randomness using few independent sources

Extracting randomness: how and why. A survey

A note on the instance complexity of pseudorandom sets

Cryptography in NC/sup 0/

Randomness vs. time: de-randomization under a uniform assumption

Similar Documents

2-Source Extractors under Computational Assumptions and Cryptography with Defective Randomness

Randomness vs. Time: De-randomization under a uniform assumption (1998)

Extracting randomness from samplable distributions

In search of an easy witness: exponential time vs. probabilistic polynomial time

De-randomizing BPP: the state of the art

Extracting randomness using few independent sources

Extracting randomness: how and why. A survey

A note on the instance complexity of pseudorandom sets

Cryptography in NC/sup 0/

Randomness vs. time: de-randomization under a uniform assumption