✦ LIBER ✦

On polynomial-time truth-table reducibility of intractable sets to P-selective sets

✍ Scribed by Seinosuke Toda

Publisher: Springer
Year: 1991
Tongue: English
Weight: 739 KB
Volume: 24
Category: Article
ISSN: 1433-0490
DOI: 10.1007/bf02090391

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Quasi-linear truth-table reductions to p

Quasi-linear truth-table reductions to p-selective sets

✍ M. Agrawal; V. Arvind 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 663 KB

On Sets Turing Reducible to p-Selective

On Sets Turing Reducible to p-Selective Sets

✍ H.-J. Burtschick 📂 Article 📅 1997 🏛 Springer 🌐 English ⚖ 97 KB

P-selective sets, tally languages, and t

P-selective sets, tally languages, and the behavior of polynomial time reducibilities onNP

✍ Alan L. Selman 📂 Article 📅 1979 🏛 Springer 🌐 English ⚖ 677 KB

Deterministic and Randomized Bounded Tru

Deterministic and Randomized Bounded Truth-Table Reductions of P, NL, and L to Sparse Sets

✍ Dieter van Melkebeek 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 545 KB

We prove that there is no sparse hard set for P under logspace computable bounded truth-table reductions unless P=L. In case of reductions computable in NC 1 , the collapse goes down to P=NC 1 . We parameterize this result and obtain a generic theorem allowing us to vary the sparseness condition, th