Advice from Nonadaptive Queries to NP
Yenjo Han, Thomas Thierauf · 1993
Consider the standard model of computation to decide a language that is bounded truth-table reducible to an NP set: on a given input, a polynomial-time Turing machine, called a generalor, produces a constant number of queries to the NP oracle; then, a second polynomial-time Turing machine, called an evalualor, given the answers to the queries, determines the membership of the given input.