Pinpointing Computation with Modular Queries in the Boolean Hierarchy

@inproceedings{Agrawal1996PinpointingCW,
  title={Pinpointing Computation with Modular Queries in the Boolean Hierarchy},
  author={Manindra Agrawal and Richard Beigel and Thomas Thierauf},
  booktitle={FSTTCS},
  year={1996}
}
A modular query consists of asking how many (modulo m) of k strings belong to a fixed NP language. Modular queries provide a form of restricted access to an NP oracle. For each k and m, we consider the class of languages accepted by NP machines that ask a single modular query. Han and Thierauf [HT95] showed that these classes coincide with levels of the Boolean hierarchy when m is even or k ≤ 2m, and they determined the exact levels. Until now, the remaining case — odd m and large k — looked… CONTINUE READING