EDP Sciences logo
Subscriber Authentication Point
Search
Menu
All issues Volume 25 / No 3 (1991) RAIRO-Theor. Inf. Appl., 25 3 (1991) 293-302 References
Free Access
Issue
RAIRO-Theor. Inf. Appl.
Volume 25, Number 3, 1991
Page(s) 293 - 302
DOI https://doi.org/10.1051/ita/1991250302931
Published online 01 February 2017
  1. 1. E. ALLENDER and R. RUBINSTEIN, P-printable sets, S.I.A.M. J. Comput., 1988, 17, pp. 1193-1202. [MR: 972668] [Zbl: 0682.68039] [Google Scholar]
  2. 2. E. ALLENDER and O. WATANABE, Kolmogorov complexity and degrees of tally sets, Inform. and Comput., 1990, 86, pp. 160-178. [MR: 1054537] [Zbl: 0704.03023] [Google Scholar]
  3. 3. T. BAKER, J. GILL and R. SOLOWAY, Relativizations of the P = ? NP question, S.I.A.M. J. Comput., 1975, 4, pp. 431-442. [MR: 395311] [Zbl: 0323.68033] [Google Scholar]
  4. 4. J. BALCÁZAR and R. BOOK, Sets with small generalized Kolmogorov complexity, Acta Inform., 1986, 23, pp. 679-688. [MR: 865501] [Zbl: 0616.68046] [Google Scholar]
  5. 5. J. BALCÁZAR, J. DÍAZ and J. GABARRÓ, Structural Complexity, I and II, Springer-Verlag, 1988, and 1990. [MR: 1047862] [Zbl: 0638.68040] [Google Scholar]
  6. 6. R. BOOK and K. KO, On sets truth-table reducible to sparse sets, S.I.A.M. J. Comput., 1988, 77, pp. 903-919. [MR: 961047] [Zbl: 0665.68040] [Google Scholar]
  7. 7. J. HARTMANIS, N. IMMERMAN and V. SEWELSON, Sparse sets in NP-P: EXPTIME versus NEXPTIME, Proc. 15th A.C.M. Symp. Theory of Computing, 1983, pp. 382-391. [Zbl: 0586.68042] [Google Scholar]
  8. 8. K. KO, Continuous optimization problems and a polynomial hierarchy of real functions, J. Complexity, 1985, 1, pp. 210-231. [MR: 925429] [Zbl: 0609.03015] [Google Scholar]
  9. 9. K. KO, Distinguishing bounded reducibilities by sparse sets, Inform. and Comput., 1989, 81, pp. 62-87. [MR: 992304] [Zbl: 0681.68066] [Google Scholar]
  10. 10. R. LANDER, N. LYNCH and A. SELMAN, A comparison of polynomial-time reducibilities, Theoret. Comput. Sci., 1975, 1, pp. 103-123. [MR: 395319] [Zbl: 0321.68039] [Google Scholar]
  11. 11. T. LONG, Strong nondeterministic polynomial-time reducibilites, Theoret. Comput. Sci., 1982, 21, pp. 1-25. [MR: 672099] [Zbl: 0521.03028] [Google Scholar]
  12. 12. T. LONG, On restricting the size of oracles compared with restricting access to oracles, S.I.A.M. J. Comput., 1985, 14, pp. 585-597. [MR: 795932] [Zbl: 0583.68025] [Google Scholar]
  13. 13. U. SCHÖNING, Complexity and Structure, L.N.C.S., No. 211, 1986, Springer-Verlag Publ. Co. [MR: 827009] [Zbl: 0589.03022] [Google Scholar]

Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.

Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.

Initial download of the metrics may take a while.