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 quite difficult. We pinpoint the level in the Boolean hierarchy for the remaining case; thus, these classes coincide with levels of the Boolean hierarchy for every k and m. In addition we characterize the classes obtained by using an NP(l) acceptor in place of an NP acceptor (NP(l) is the lth level of the Boolean hierarchy). As before, these all coincide with levels in the Boolean hierarchy.
CITATION STYLE
Agrawal, M., Beigel, R., & Thierauf, T. (1996). Pinpointing computation with modular queries in the boolean hierarchy. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1180, pp. 322–334). Springer Verlag. https://doi.org/10.1007/3-540-62034-6_60
Mendeley helps you to discover research relevant for your work.