Characterizations of some complexity classes between Θ p 2 and ∆ p 2

@inproceedings{Castro2007CharacterizationsOS,
  title={Characterizations of some complexity classes between Θ p 2 and ∆ p 2},
  author={Jorge Castro},
  year={2007}
}
We give some characterizations of the classes P [O(log n)]. First, we show that these classes are equal to classes ACk−1(NP ). Second, we prove that they are also equivalent to some classes defined in the Extended Boolean hierarchy. As a last characterization, we show that there exists a strong connection between classes defined by polynomial time Turing machines with few queries to an NP oracle and classes defined by small size circuits with NP oracle gates. With these results we solve open… CONTINUE READING