1. Cook, S., Reckhow, R.: The relative efficiency of propositional proof systems. Journal of Symbolic Logic 44, 36–50 (1979)
2. Glaßer, C., Selman, A., Sengupta, S., Zhang, L.: Disjoint NP-pairs. In: Proceedings 18th Annual IEEE Conference on Computational Complexity, pp. 313–332 (2003)
3. Glaßer, C., Selman, A., Sengupta, S.: Reductions between disjoint NP-pairs. In: Proceedings 19th Annual IEEE Conference on Computational Complexity (2004)
4. Grollmann, J., Selman, A.: Complexity measures for public-key cryptosystems. SIAM Journal on Computing 17(2), 309–335 (1988)
5. Köbler, J., Messner, J., Torán, J.: Optimal proof systems imply complete sets for promise classes. Information and Computation 184, 71–92 (2003)