This is a preview of subscription content, log in via an institution to check access.
Literature cited
M. Blum, “A machine-independent theory of the complexity of recursive functions,” J. ACM,14, No. 2, 322–336 (1967).
L. A. Levin, “Universal enumeration problems,” Probl. Peredachi Inf.,9, No. 3, 115–116 (1973).
J. Krajiĉek and P. Pudlak, “Prepositional proof systems, the consistency of first order theories and the complexity of computations,” Preprint, Math Inst. Czechoslovak Akad. Sci., Prague (1987).
T. Baker, J. Gill, and R. Solovay, “Relativizations of theP vsNP question,” SIAM J. Comput.,4, No. 4, 431–442 (1975).
Author information
Authors and Affiliations
Additional information
Translated from Matematicheskie Zametki, Vol. 50, No. 2, pp. 37–46, August, 1991.
The author is indebted to A. A. Razborov for valuable comments and discussion and to S. I. Adyan for his constant attention.
Rights and permissions
About this article
Cite this article
Verbitskii, O.V. Optimal algorithms for coNP-sets and theEXP \(\mathop = \limits^?\) NEXP problem. Mathematical Notes of the Academy of Sciences of the USSR 50, 796–801 (1991). https://doi.org/10.1007/BF01157564
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF01157564