1. Dose, T.: P-optimal proof systems for each set in NP but no complete disjoint NP-pairs relative to an oracle. arXiv e-prints.
arXiv:1904.06175
, April 2019
2. Dose, T., Glaßer, C.: NP-completeness, proof systems, and disjoint NP-pairs. Technical Report 19–050, Electronic Colloquium on Computational Complexity (ECCC) (2019)
3. Even, S., Selman, A.L., Yacobi, J.: The complexity of promise problems with applications to public-key cryptography. Inf. Control 61, 159–173 (1984)
4. Lecture Notes in Computer Science;S Even,1980
5. Glaßer, C., Selman, A.L., Sengupta, S., Zhang, L.: Disjoint NP-pairs. SIAM J. Comput. 33(6), 1369–1416 (2004)