scientific article; zbMATH DE number 4037840

From MaRDI portal
Publication:3778006





[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?











This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3778006)