Advertisement

Exact pairs for abstract bounded reducibilities

  • Wolfgang Merkle
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1258)

Abstract

In an attempt to give a unified account of common properties of various resource bounded reducibilities, we introduce conditions on a binary relation ≤ r between subsets of the natural numbers where ≤ r is meant as a resource bounded reducibility. The conditions are a formalization of basic features shared by most resource bounded reducibilities which can be found in the literature. As our main technical result, we show that these conditions imply a result about exact pairs which has been previously shown by Ambos-Spies [2] in a setting of polynomial time bounds: given some recursively presentable ≤ r — ideal I and some recursive ≤ r — hard set B for I which is not contained in I, there is some recursive set C where B and C are an exact pair for I, that is, I is equal to the intersection of the lower ≤ r — cones of B and C where C is not in I. In particular, if the relation ≤ r is in addition transitive and there are least sets, then every recursive set which is not in the least degree is half of a minimal pair of recursive sets.

Keywords

Binary Relation Partial Function Recursive Function Finite Variation Minimal Pair 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Klaus Ambos-Spies. Sublattices of the polynomial time degrees. Information and Control, 65(1):63–84, 1985.Google Scholar
  2. 2.
    Klaus Ambos-Spies. Minimal pairs for polynomial time reducibilities. In Egon Börger, editor, Computation Theory and Logic, Lecture Notes in Computer Science 270. Springer-Verlag, 1987.Google Scholar
  3. 3.
    Klaus Ambos-Spies. A note on minimal and exact pairs in the polynomial degrees. Unpublished research note, 1991.Google Scholar
  4. 4.
    Klaus Ambos-Spies and André Nies. The theory of the polynomial many-one degrees of the recursive sets is undecidable. In Symposium on Theoretical Aspects of Computer Science 92, 1992.Google Scholar
  5. 5.
    Manuel Blum. A machine-independent theory of the complexity of recursive functions. Journal of the Association for Computing Machinery, 14(2):322–336, 1967.Google Scholar
  6. 6.
    Ronald V. Book, Jack H. Lutz, and Klaus W. Wagner. An observation on probability versus randomness with applications to complexity classes. Mathematical Systems Theory, 27(3):201–209, 1994.Google Scholar
  7. 7.
    Bernd Borchert. Predicate classes and promise classes. In Proc. Ninth Structure in Complexity Theory Conference, 1994.Google Scholar
  8. 8.
    Richard E. Ladner. On the structure of polynomial time reducibility. Journal of the Association for Computing Machinery, 22(1):155–171, 1975.Google Scholar
  9. 9.
    Larry H. Landweber, Richard J. Lipton, and Ed L. Robertson. On the structure of sets in N P and other complexity classes. Theoretical Computer Science, 15:181–200, 1981.Google Scholar
  10. 10.
    Kurt Mehlhorn. Polynomial and abstract subrecursive classes. Journal of Computer and System Sciences, 12:147–178, 1976.Google Scholar
  11. 11.
    Wolfgang Merkle. A Generalized Account of Resource Bounded Reducibilities. Thesis, Heidelberg, Germany, 1996.Google Scholar
  12. 12.
    Wolfgang Merkle and Yongge Wang. Random separations and “Almost” classes for generalized reducibilities. In Mathematical Foundations of Computer Science, Lecture Notes in Computer Science 969. Springer-Verlag, Berlin Heidelberg New York, 1995.Google Scholar
  13. 13.
    Piergiorgio Odifreddi. Classical Recursion Theory. North-Holland, Amsterdam, 1989.Google Scholar
  14. 14.
    Diana Schmidt. The recursion-theoretic structure of complexity classes. Theoretical Computer Science, 38:143–156, 1985.Google Scholar
  15. 15.
    María J. Serna. The parallel approximability of P-complete problems. Tesis doctoral, Universitat Politècnica de Catalunya, Barcelona, Spain, 1990.Google Scholar
  16. 16.
    Juichi Shinoda and Theodore A. Slaman. On the theory of the PTIME degrees of the recursive sets. Journal of Computer and System Sciences, 41:321–366, 1990.Google Scholar
  17. 17.
    Robert I. Soare. Recursively Enumerable Sets and Degrees. Springer-Verlag, Berlin Heidelberg New York, 1987.Google Scholar
  18. 18.
    Heribert Vollmer. The gap-language-technique revisited. In Egon Börger, Hans Kleine-Büning, and Michael M. Richter, editors, Computer Science Logic 90, Lecture Notes in Computer Science. Springer-Verlag, 1991.Google Scholar
  19. 19.
    Xizhong Zheng. On the maximality of some pairs of p-t degrees. Notre Dame Journal of Formal Logic, 34(1):29–35, 1994.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1997

Authors and Affiliations

  • Wolfgang Merkle
    • 1
  1. 1.Mathematisches InstitutUniversität HeidelbergHeidelbergGermany

Personalised recommendations