No label defined (Q3778006)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 4037840
Language Label Description Also known as
default for all languages
No label defined
    English
    No label defined
    scientific article; zbMATH DE number 4037840

      Statements

      0 references
      1987
      0 references
      minimal pair
      0 references
      polynomial time reducibility
      0 references
      polynomial time computable
      0 references
      [For the entire collection see Zbl 0624.00016.] Two sets A and B form a minimal pair if they are both recursive and if neither A nor B can be computed in polynomial time but every set which reduces (with respect to some polynomial time reducibility notion) to both A and B is polynomial time computable. The author positively answers questions of the following form: given a recursive A which cannot be computed in polynomial time, does there exist a recursive B such that A, B form a minimal pair?
      0 references

      Identifiers