✦ LIBER ✦

Limitations on Separating Nondeterministic Complexity Classes

✍ Scribed by Rackoff, Charles W.; Seiferas, Joel I.

Book ID: 118174080
Publisher: Society for Industrial and Applied Mathematics
Year: 1981
Tongue: English
Weight: 484 KB
Volume: 10
Category: Article
ISSN: 0097-5397
DOI: 10.1137/0210057

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Separating NE from some nonuniform nonde

Separating NE from some nonuniform nondeterministic complexity classes

✍ Bin Fu; Angsheng Li; Liyu Zhang 📂 Article 📅 2010 🏛 Springer US 🌐 English ⚖ 465 KB

Separation of deterministic, nondetermin

Separation of deterministic, nondeterministic and alternating complexity classes

✍ Andrej Bebják; Ivana Štefáneková 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 907 KB

Separating Complexity Classes Using Auto

Separating Complexity Classes Using Autoreducibility

✍ Buhrman, Harry; Fortnow, Lance; van Melkebeek, Dieter; Torenvliet, Leen 📂 Article 📅 2000 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 268 KB

On sparse oracles separating feasible co

On sparse oracles separating feasible complexity classes

✍ Juris Hartmanis; Lane Hemachandra 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 584 KB

Separating complexity classes with tally

Separating complexity classes with tally oracles

✍ Lane A. Hemachandra; Roy S. Rubinstein 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 712 KB

Separating complexity classes related to

Separating complexity classes related to Ω-decision trees

✍ Carsten Damm; Christoph Meinel 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 565 KB