The shrinking property for NP and coNP

  • Authors:

  • Christian Glaβer;Christian Reitwieβner;Victor Selivanov

  • Affiliations:

  • Julius-Maximilians-Universität Würzburg, Germany;Julius-Maximilians-Universität Würzburg, Germany;A.P. Ershov Institute of Informatics Systems, Siberian Division of the Russian Academy of Sciences, Russia

  • Venue:
  • Theoretical Computer Science
  • Year:
  • 2011

Quantified Score

Hi-index 5.23

Visualization

Abstract

We study the shrinking and separation properties (two notions well-known in descriptive set theory) for NP and coNP and show that under reasonable complexity-theoretic assumptions, both properties do not hold for NP and the shrinking property does not hold for coNP. In particular we obtain the following results. 1.NP and coNP do not have the shrinking property unless PH is finite. In general, @S"n^P and @P"n^P do not have the shrinking property unless PH is finite. This solves an open question posed by Selivanov (1994) [33]. 2.The separation property does not hold for NP unless UP@?coNP. 3.The shrinking property does not hold for NP unless there exist NP-hard disjoint NP-pairs (existence of such pairs would contradict a conjecture of Even et al. (1984) [6]). 4.The shrinking property does not hold for NP unless there exist complete disjoint NP-pairs. Moreover, we prove that the assumption NPcoNP is too weak to refute the shrinking property for NP in a relativizable way. For this we construct an oracle relative to which P=NP@?coNP, NPcoNP, and NP has the shrinking property. This solves an open question posed by Blass and Gurevich (1984) [3] who explicitly ask for such an oracle.