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.
KeywordsBoolean Formula Satisfying Assignment Bibliographic Note Polynomial Hierarchy Circuit Family
Unable to display preview. Download preview PDF.