The Shrinking Property for NP and coNP

  • Authors:

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

  • Affiliations:

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

  • Venue:
  • CiE '08 Proceedings of the 4th conference on Computability in Europe: Logic and Theory of Algorithms
  • Year:
  • 2008

Quantified Score

Hi-index 0.00

Visualization

Abstract

We study the shrinking and separation properties (two notions well-known in descriptive set theory) for and and show that under reasonable complexity-theoretic assumptions, both properties do not hold for and the shrinking property does not hold for . In particular we obtain the following results. 1and do not have the shrinking property, unless is finite. In general, and do not have the shrinking property, unless is finite. This solves an open question from [25].1The separation property does not hold for , unless .1The shrinking property does not hold for , unless there exist -hard disjoint -pairs (existence of such pairs would contradict a conjecture by Even, Selman, and Yacobi [6]).1The shrinking property does not hold for , unless there exist complete disjoint -pairs.Moreover, we prove that the assumption is too weak to refute the shrinking property for in a relativizable way. For this we construct an oracle relative to which , , and has the shrinking property. This solves an open question by Blass and Gurevich [2] who explicitly ask for such an oracle.