✦ LIBER ✦

Power from Random Strings

✍ Scribed by Allender, Eric; Buhrman, Harry; Koucký, Michal; van Melkebeek, Dieter; Ronneburger, Detlef

Book ID: 118180677
Publisher: Society for Industrial and Applied Mathematics
Year: 2006
Tongue: English
Weight: 300 KB
Volume: 35
Category: Article
ISSN: 0097-5397
DOI: 10.1137/050628994

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On the computational power of random str

On the computational power of random strings

✍ Adam R. Day 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 886 KB

Limits on the computational power of ran

Limits on the computational power of random strings

✍ Eric Allender; Luke Friedman; William Gasarch 📂 Article 📅 2013 🏛 Elsevier Science 🌐 English ⚖ 234 KB

Deviations from uniformity in random str

Deviations from uniformity in random strings

✍ P. Flajolet; P. Kirschenhofer; R. F. Tichy 📂 Article 📅 1988 🏛 Springer 🌐 English ⚖ 568 KB

Random Strings Make Hard Instances

✍ Harry Buhrman; Pekka Orponen 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 271 KB

We establish the truth of the ``instance complexity conjecture'' in the case of DEXT-complete sets over polynomial time computations, and r.e. complete sets over recursive computations. Specifically, we obtain for every DEXT-complete set A an exponentially dense subset C and a constant k such that f

Recognizing sources of random strings

✍ Valiveti, R.S.; Oommen, B.J. 📂 Article 📅 1991 🏛 IEEE 🌐 English ⚖ 803 KB

Fermionic random walk and spinning strin

Fermionic random walk and spinning strings

✍ Aleksandar Miković 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 277 KB