Optimal approximations of complete sets

  • David A. Russo
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 223)


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [DIR]
    D.Z. Du, T. Isakowitz, and D.A. Russo, Structural properties of complexity cores, submitted for publication.Google Scholar
  2. [GaJ79]
    M. Gary and D. Johnson, Computers and Intractability, W. H. Freeman, San Francisco (1979).Google Scholar
  3. [HU79]
    J.E. Hopcroft and J.D. Ullman, Introduction to Automata Theory, Languages and Computation, Addison-Wesley (1979).Google Scholar
  4. [Ko85]
    K. Ko, Non-levelable sets and immune sets in the accepting density hierarchy in NP, Math. Systems Theory 18, (1985) 189–205.Google Scholar
  5. [KM81]
    K. Ko and D. Moore, Completeness, approximation and density, SIAM J. Comput. 10, (1981) pp 787–796.Google Scholar
  6. [Lyn75]
    N. Lynch, On reducibility to complex or sparse sets. J. Assoc. Comput. Mach. 22, (1975), 341–345.Google Scholar
  7. [MP79]
    A.R. Meyer, and M.S. Paterson, With what frequency are apparently intractible problems difficult? Tech. Rep. TM-126, Laboratory for Computer Science, (1979) Massachusetts Institute of Technology, Cambridge, Ma.Google Scholar
  8. [ORS85]
    P. Orponen, D.A. Russo, and U. Schöning, Optimal approximations and polynomially levelable sets, SIAM J. Comput., to appear.Google Scholar
  9. [OrS84]
    P. Orponen and U. Schöning, The structure of polynomial complexity cores, Proc. 11th Symp. on Mathematical Foundations of Computer Science, Lecture Notes in Computer Science 176 (1984), 452–458.Google Scholar
  10. [RO]
    D.A. Russo and P. Orponen, A duality between polynomial time computable subsets and complexity cores, submitted for publication.Google Scholar
  11. [Wa85]
    O. Watanabe, On one-one polynomial time equivalence relations. Theoret. Comput. Sci. 38, (1985), 157–165.Google Scholar
  12. [Yo83]
    P. Young, Some structural properties of polynomial reducibilities, Proc. 15th Symp. Theory of Computing, (1983) pp 392–401.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1986

Authors and Affiliations

  • David A. Russo
    • 1
    • 2
  1. 1.Dept. of MathematicsUniversity of CaliforniaSanta Barbara
  2. 2.Digital Sound CorporationSanta Barbara

Personalised recommendations