329 citations · 671 across the 10 of their papers we have counts for
1 paper · 1 filter
Adam Chalcraft, Samuel Kutin, David Petrie Moulton
The polynomial hierarchy is a grading of problems by difficulty, including P, NP and coNP as the best known classes. The promise polynomial hierarchy is similar, but extended to in…