Optimization problems in the polynomial-time hierarchy

Authors:
Christopher Umans
Affiliations:
Computer Science Department, California Institute of Technology, Pasadena, CA
Venue:
TAMC'06 Proceedings of the Third international conference on Theory and Applications of Models of Computation
Year:
2006

Citing 9
Cited 0

Oracles and queries that are sufficient for exact learning

Journal of Computer and System Sciences
Computing with Very Weak Random Sources

SIAM Journal on Computing
Uniform generation of NP - witnesses using an NP -oracle

Information and Computation
Loss-less condensers, unbalanced expanders, and extractors

STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
The minimum equivalent DNF problem and shortest implicants

Journal of Computer and System Sciences
On the complexity of approximating the VC dimension

Journal of Computer and System Sciences - Complexity 2001
The Minimization Problem for Boolean Formulas

FOCS '97 Proceedings of the 38th Annual Symposium on Foundations of Computer Science
Hardness of Approximating Minimization Problems

FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
Approximability and completeness in the polynomial hierarchy

Approximability and completeness in the polynomial hierarchy

Quantified Score

Hi-index	0.00

Visualization

Abstract

This talk surveys work on classifying the complexity and approximability of problems residing in the Polynomial-Time Hierarchy, above the first level. Along the way, we highlight some prominent natural problems that are believed – but not yet known – to be $\Sigma^p_2$-complete. We describe how strong inapproximability results for certain $\Sigma^p_2$ optimization problems can be obtained using dispersers to build error-correcting codes. Finally we adapt a learning algorithm to produce approximation algorithms for these problems.