Advice

  • Lane A. Hemaspaandra
  • Leen Torenvliet
Part of the Monographs in Theoretical Computer Science An EATCS Series book series (EATCS)

Abstract

As we saw in Chapter 1, no upper bound exists on the computational complexity of P-selective sets. Theorem 1.16 says that every tally language is polynomial-time Turing equivalent to some P-selective set. Since tally sets can be arbitrarily complex, so can P-selective sets.

Keywords

Parkin Cond Padding 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2003

Authors and Affiliations

  • Lane A. Hemaspaandra
    • 1
  • Leen Torenvliet
    • 2
  1. 1.Department of Computer ScienceUniversity of RochesterRochesterUSA
  2. 2.Department of Computer ScienceUniversity of AmsterdamAmsterdamThe Netherlands

Personalised recommendations