𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Promise problems complete for complexity classes

✍ Scribed by Alan L. Selman


Book ID
113383872
Publisher
Elsevier Science
Year
1988
Tongue
English
Weight
584 KB
Volume
78
Category
Article
ISSN
0890-5401

No coin nor oath required. For personal study only.


πŸ“œ SIMILAR VOLUMES


Do there exist complete sets for promise
✍ 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