OpenAlex
PricingAboutJobs
Log inGet started
Work

Power from random strings

HTML

Year: 2003
Type: conference-paper
Source: Annual Symposium on Foundations of Computer Science
DOI: 10.1109/sfcs.2002.1181992
Authors: E. Allender, H. Buhrman, M. Koucky, D. van Melkebeek, D. Ronneburger
Institutions: Rutgers, The State University of New Jersey, Centrum Wiskunde & Informatica, University of Amsterdam
Language: English

Topic: Computability, Logic, AI Algorithms
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Keywords: Kolmogorov complexity, random strings, computational completeness, truth-table reductions, PSPACE, EXP, P/poly, BPP, discrete logarithm problem, integer factorization, lattice problems, relativization

Open Access status: closed

Funder: Microsoft Research
OpenAlex ID: W2162351389
FWCI: 3.17
Cites: 61
Cited by: 25
Related to: 10
OpenAlex
Nonprofit
Open DataOpen Data
Open Source
Product
Search
Compare
Pricing
Repositories
Unpaywall
Unsub
Developers
API docs
Data snapshot
Status
Source code
Organization
About
Team
Testimonials
Brand
Jobs
Community
Help center
Contact
Events
Blog
Mailing list
Subscribe
Supporters
Legal
Privacy
Accessibility
Terms
Security