NDLI: Power from random strings

Content Provider	IEEE Xplore Digital Library
Author	Allender, E. Buhrman, H. Koucky, M. van Melkebeek, D. Ronneburger, D.
Copyright Year	2002
Abstract	We show that sets consisting of strings of high Kolmogorov complexity provide examples of sets that are complete for several complexity classes under probabilistic and non-uniform reductions. These sets are provably not complete under the usual many-one reductions. Let R/sub K/, R/sub Kt/, R/sub KS/, R/sub KT/ be the sets of strings x having complexity at least \|x\|/2, according to the usual Kolmogorov complexity measure K, Levin's time-bounded Kolmogorov complexity Kt [27], a space-bounded Kolmogorov measure KS, and the time-bounded Kolmogorov complexity measure KT that was introduced in [4], respectively. Our main results are: 1. R/sub KS/ and R/sub Kt/ are complete for PSPACE and EXP, respectively, under P/poly-truth-table reductions. 2. EXP = NP/sup R(Kt)/. 3. PSPACE = ZPP/sup R(KS)/ /spl sube/ P/sup R(K)/. 4. The Discrete Log, Factoring, and several lattice problems are solvable in BPP/sup R(KT)/.
Sponsorship	IEEE Comput. Soc. Tech. Committee on Maht. Found. Comput. (TCMF) ACM/SIGACT
Starting Page	669
Ending Page	678
File Size	415841
Page Count	10
File Format	PDF
ISBN	0769518222
ISSN	02725428
DOI	10.1109/SFCS.2002.1181992
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	2002-11-19
Publisher Place	Canada
Access Restriction	Subscribed
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	Polynomials Artificial intelligence Lattices Engineering profession 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

A separation of determinism, Las Vegas and nondeterminism for picture recognition

Relative primeness of two polynomials

Learning mixtures of product distributions over discrete domains

Hardness of approximating the minimum distance of a linear code

Number-theoretic constructions of efficient pseudo-random functions

Optimal reconfiguration of radial distribuion system using artificial intelligence methods

Computational aspects of the Mobius transformation of graphs

A novel approach for solving Diophantine equations

On a series-parallel-cascade structure

Power from random strings

Similar Documents

A separation of determinism, Las Vegas and nondeterminism for picture recognition

Relative primeness of two polynomials

Learning mixtures of product distributions over discrete domains

Hardness of approximating the minimum distance of a linear code

Number-theoretic constructions of efficient pseudo-random functions

Optimal reconfiguration of radial distribuion system using artificial intelligence methods

Computational aspects of the Mobius transformation of graphs

A novel approach for solving Diophantine equations

On a series-parallel-cascade structure

Power from random strings