EDP Sciences logo
Subscriber Authentication Point
Search
Menu
All issues Volume 30 / No 2 (1996) RAIRO-Theor. Inf. Appl., 30 2 (1996) 135-154 References
Free Access
Issue
RAIRO-Theor. Inf. Appl.
Volume 30, Number 2, 1996
Page(s) 135 - 154
DOI https://doi.org/10.1051/ita/1996300201351
Published online 01 February 2017
  1. [AA94] M. AGRAWAL and V. ARVIND, Polynomial-time truth-table reductions to P-selective sets, In Proc. 9th Structure in Complexity Theory Conference, 1994, IEEE, 24-30. [Google Scholar]
  2. [AHH+93] V. ARVIND, Y. HAN, L. HEMACHANDRA, J. KÖBLER, A. LOZANO, M. MUNDHENK, M. OGIWARA, U. SCHÖNING, R. SILVESTRI and T. THIERAUF, Reductions to sets of low information content, Recent Developments in Complexity Theory, Cambridge University Press, (Also available as Technical Report TR-417, University of Rochester, Department of Computer Science, Rochester, NY, April 1992). [Zbl: 0794.68058] [Google Scholar]
  3. [AI186] E. ALLENDER, The complexity of sparse sets in P, In Proceedings 1st Structure in Complexity Theory Conference, 1986, 1-11, IEEE Computer Society. [MR: 854886] [Zbl: 0608.68035] [Google Scholar]
  4. [BDG88] J. BALCÁZAR, J. DÍAZ and J. GABARRÓ, Structural Complexity I. 1988, EATCS Monographs on Theoretical Computer Science, Springer-Verlag. [MR: 1047862] [Zbl: 0638.68040] [Google Scholar]
  5. [BDG91] J. BALCÁZAR, J. DÍAZ and J. GABARRÓ, Structural Complexity II. 1991, EATCS Monographs on Theoretical Computer Science, Springer-Verlag. [MR: 1056474] [Zbl: 0746.68032] [Google Scholar]
  6. [Bei88] R. BEIGEL, NP-hard sets are P-superterse unless R = NP, Technical Report 88-04, Department of Computer Science, The John Hopkins University, 1988. [Google Scholar]
  7. [BKS94] R. BEIGEL, M. KUMMER and F. STEPHAN, Approximable sets. In Poc. 9th Structure in Complexity Theory Conference, IEEE, 12-23, 1994. [MR: 1343609] [Google Scholar]
  8. [ESY84] S. EVAN, A. SELMAN and Y. YACOBI, The complexity of promise problems with applications to public-key cryptography, Information and Control, 1984, 61, pp. 114-133. [MR: 772678] [Zbl: 0592.94012] [Google Scholar]
  9. [HHO+93] L. HEMACHANDRA, A. HOENE, M. OGIWARA, A. SELMAN, T. THIERAUF and J. WANG, Selectivity. In Proceedings of the 5th International Conference on Computation and Information, ICCI 93, IEEE, pp. 55-59, 1993. [Google Scholar]
  10. [HOW92] L. HEMACHANDRA, M. OGIWARA and O. WATANABE, How hard are sparse sets? In Proc. 7th Strcuture in Complexity Theory Conference, IEEE 222-238, 1992. [MR: 1249979] [Google Scholar]
  11. [HL94] S. HOMER and L. LONGPRÉ, On Reductions of NP to Sparse Sets, Journal of Computer and System Sciences, 1994, 48, pp. 324-336. [MR: 1275036] [Zbl: 0806.68046] [Google Scholar]
  12. [JT93] B. JENNER and J. TORÁN, Computing functions with parallel queries to NP, In Proc. 8th Structure in Complexity Theory Conference, IEEE 280-291, 1, 1993. [Zbl: 0873.68058] [MR: 1310807] [Google Scholar]
  13. [Joc68] C. JOCKUSCH, Semirecursive sets and positive reducibility, Transactions of the AMS, 1968, 131, (2), pp. 420-436. [MR: 220595] [Zbl: 0198.32402] [Google Scholar]
  14. [KL82] R. KARP and R. LIPTON, Turing machines that take advice, L'Enseignement Mathématique, 1982, 28, pp. 191-209. [MR: 684233] [Zbl: 0529.68025] [Google Scholar]
  15. [Ko83] K. KO, On self-reducibility and weak P-selectivity, Journal of Computer and System Sciences, 1983, 26, pp. 209-221. [MR: 708837] [Zbl: 0519.68062] [Google Scholar]
  16. [LLS75] R. LADNER, N. LYNCH and A. SELMAN, A comparison of polynomial time reducibilities, Theoretical Computer Science, 1975, 1, (2), pp. 103-124. [MR: 395319] [Zbl: 0321.68039] [Google Scholar]
  17. [Mah82] S. MAHANEY, Sparse complete sets for NP: solution of a conjecture of Berman and Hartmanis, Journal of Computer and System Sciences, 1982, 25, pp. 130-143. [MR: 680515] [Zbl: 0493.68043] [Google Scholar]
  18. [O94] M. OGIHRA, Polynomial-time membership comparable sets, In Proc. 9th Structure in Complexity Theory Conference, IEEE, 2-11, 1994. [Google Scholar]
  19. [OW91] M. OGIWARA and O. WATANABE, On polynomial-time bounded truth-table reducibility of NP sets to sparse sets, SIAM Journal on Computing, 1991, 20, (3), pp.471-483. [MR: 1094526] [Zbl: 0741.68049] [Google Scholar]
  20. [Sal93] S. SALUJA, Relativized limitations of the left settechnique andclosure classes of sparse sets, In Proc. 8th Structure in Complexity Theory Conference, IEEE, 215-222, 1993. [Google Scholar]
  21. [Sch90] U. SCHÖNING, The power of counting, In Complexity Theory Retrospective (A.Selman Ed.), Springer-Verlag, 1990, pp. 204-223. [MR: 1060786] [Google Scholar]
  22. [Sel79] A. SELMAN, P-selective sets, tally languages, and the behavior of polynomial time reducibilities on NP, Mathematical Systems Theory, 1979, 13, pp. 55-65. [MR: 548549] [Zbl: 0405.03018] [Google Scholar]
  23. [Sel82a] A. SELMAN, Analogues of Semirecursive sets and effective reducibilities to the study of NP complexity, Information and Control, 1982, pp.36-51. [MR: 693995] [Zbl: 0504.03022] [Google Scholar]
  24. [Sel82b] A. SELMAN, Reductions on NP and P-selective sets, Theoretical Computer Science, 1982, 19, pp. 287-304. [MR: 671872] [Zbl: 0489.03016] [Google Scholar]
  25. [Sto77] L. STOCKMEYER, The polynomial-time hierarchy, Theoretical Computer Science, 1977, 3, pp. 1-22. [MR: 438810] [Zbl: 0353.02024] [Google Scholar]
  26. [Tod91] S. TODA, On polynomial-time truth-table reducibilities of intractable sets of P-selective sets, Mathematical Systems Theory, 1991, pp. 69-82. [MR: 1096692] [Zbl: 0722.68059] [Google Scholar]
  27. [Tor93] J. TORÁN, Personal Communication. [Google Scholar]
  28. [Val76] L. VALIANT, Relative complexity of checking and evaluating, Information Processing Letters, 1976, 5, (1), pp. 20-23. [MR: 403318] [Zbl: 0342.68028] [Google Scholar]
  29. [VV86] L. VALIANT and V. VAZIRANI, NP is as easy as detecting unique solutions, Theoretical Computer Science, 1986, 47, pp. 85-93. [MR: 871466] [Zbl: 0621.68030] [Google Scholar]
  30. [Wat90] O. WATANABE, Unpublished note. [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.