Funder
Russian Foundation for Basic Research
Russian Academic Excellence Project
Publisher
Springer Science and Business Media LLC
Subject
Applied Mathematics,Computer Science Applications,General Computer Science
Reference22 articles.
1. Agrawal, M., Arvind, V.: Quasi-linear truth-table reductions to p-selective sets. Theor. Comput. Sci. 158, 361–370 (1996)
2. Balcázar, J., Díaz, J., Gabarró, J.: Structural Complexity I. Springer, Berlin (1988)
3. Buhrman, H., Fortnow, L., Thierauf, T.: Nonrelativizing separations. In: IEEE Conference on Computational Complexity. IEEE Computer Society Press, pp. 8–12 (1998)
4. Berman, L., Hartmanis, H.: On isomorphisms and density of NP and other complete sets. SIAM J. Comput. 6, 305–322 (1977)
5. Beigel, R., Kummer, M., Stephan, F.: Approximable sets. Inf. Comput. 120(2), 304–314 (1995)