✦ LIBER ✦

Major Sets, Classes of Simple Sets, and(Q )-Complete Sets

✍ Scribed by R. Sh. Omanadze

Book ID: 110325691
Publisher: SP MAIK Nauka/Interperiodica
Year: 2002
Tongue: English
Weight: 150 KB
Volume: 71
Category: Article
ISSN: 0001-4346
DOI: 10.1023/a:1013930408357

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Complete sets and closeness to complexit

Complete sets and closeness to complexity classes

✍ Uwe Schöning 📂 Article 📅 1986 🏛 Springer 🌐 English ⚖ 935 KB

Classes of recursively enumerable sets a

Classes of recursively enumerable sets and Q-reducibility

✍ R. Sh. Omanadze 📂 Article 📅 1989 🏛 SP MAIK Nauka/Interperiodica 🌐 English ⚖ 205 KB

On two classes of sets containing all Ba

On two classes of sets containing all Baire sets and all co-analytic sets

✍ Zoltan Balogh; Harold Bennett 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 818 KB

Do there exist complete sets for promise

Do there exist complete sets for promise classes?

✍ Olaf Beyersdorff; Zenon Sadowski 📂 Article 📅 2011 🏛 John Wiley and Sons 🌐 English ⚖ 203 KB

In this paper we investigate the following two questions: Q1: Do there exist optimal proof systems for a given language L? Q2: Do there exist complete problems for a given promise class C? For concrete languages L (such as TAUT or SAT) and concrete promise classes C (such as NP ∩ coNP, UP, BPP, dis

Properties of NP‐Complete Sets

✍ Glaßer, Christian; Pavan, A.; Selman, Alan L.; Sengupta, Samik 📂 Article 📅 2006 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 291 KB

Sparse Sets and Collapse of Complexity C

Sparse Sets and Collapse of Complexity Classes

✍ Vladimı́r Glasnák 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 160 KB