Classes of bounded nondeterminism

Abstract

We study certain language classes located between P and N P that are defined by polynomial time machines with a bounded amount of nondeterminism. We observe that these classes have complete problems and find a characterization of the classes using robust machines with bounded access to the oracle, obtaining some other results in this direction. We also study questions related with the existence of complete tally sets in these classes and closure of the classes under different types of polynomial time reducibilities