Arrow Research search
Back to TCS

TCS 2009

Non-mitotic sets

Journal Article journal-article Computer Science · Theoretical Computer Science

Abstract

We study the question of the existence of non-mitotic sets in NP. We show under various hypotheses that • 1-tt-mitoticity and m-mitoticity differ on NP. • T-autoreducibility and T-mitoticity differ on NP (this contrasts the situation in the recursion theoretic setting, where Ladner showed that autoreducibility and mitoticity coincide). • 2-tt-autoreducibility does not imply weak 2-tt-mitoticity (from this it follows that autoreducibility and mitoticity are not equivalent for all reducibilities between 2-tt and T, although the notions coincide for m- and 1-tt-reducibility).

Authors

Keywords

  • Computational complexity
  • Autoreducibility
  • Mitoticity

Context

Venue
Theoretical Computer Science
Archive span
1975-2026
Indexed papers
16261
Paper id
1122989788860957565
v2026.09.13