SIGACT News Complexity Theory Column 37 Lane A. Hemaspaandra Dept. of Computer Science, University of Rochester Rochester, NY 14627, USA lane©cs.rochester.edu Introduction to Complexity Theory Column 37 This issue's guest column starts a two-part series by Marcus Schaefer and Christopher Umans on completeness for "E" and "Yr' levels of the polynomial hierarchy beyond E1 (a.k.a. NP) and p YI~ (a.k.a. coNP), in particular for the second and third levels. This issue's part of their column provides a "Garey-Johnson"-type catalog for these problems. I suspect that even experienced complexity theorists will be pleasantly surprised by how rich a collection of problems is known to be complete for these higher levels. Also worth noting are the open problems--mostly in the Open Problems section but there also are some snuggled in the Comments entries earlier. It is amazing that the classification of some problems dating back to the creation of the polynomial hierarchy remains open. Perhaps some graduate student reading this column will take up the challenge and put a final stake (i.e., a completeness result) through the heart of problems such as M I N I M A L and M I N I M U M E Q U
/lp/association-for-computing-machinery/sigact-news-complexity-theory-comun-37-CJtRCuKAKo