Hardness of Approximating Minimization Problems

Authors:
Christopher Umans
Affiliations:
-
Venue:
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
Year:
1999

Citing 31
Cited 26

Expanders, randomness, or time versus space

Journal of Computer and System Sciences - Structure in Complexity Theory Conference, June 2-5, 1986
Completeness in approximation classes

Information and Computation
Expanders that beat the eigenvalue bound: explicit construction and applications

STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Logic synthesis

Logic synthesis
Randomness is linear in space

Journal of Computer and System Sciences
Oracles and queries that are sufficient for exact learning

Journal of Computer and System Sciences
On extracting randomness from weak random sources (extended abstract)

STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
A threshold of ln n for approximating set cover (preliminary version)

STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
On Unapproximable Versions of NP-Complete Problems

SIAM Journal on Computing
A sub-constant error-probability low-degree test, and a sub-constant error-probability PCP characterization of NP

STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Improved low-degree testing and its applications

STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Almost optimal dispersers

STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Tiny families of functions with random properties: a quality-size trade-off for hashing

Proceedings of the workshop on Randomized algorithms and computation
Randomness-optimal oblivious sampling

Proceedings of the workshop on Randomized algorithms and computation
New Collapse Consequences of NP Having Small Circuits

SIAM Journal on Computing
Construction of extractors using pseudo-random generators (extended abstract)

STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Extracting all the randomness and reducing the error in Trevisan's extractors

STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Pseudorandom generators without the XOR Lemma (extended abstract)

STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
On the hardness of approximating minimization problems

Journal of the ACM (JACM)
Extracting randomness: a survey and new constructions

Journal of Computer and System Sciences
Deciding the Vapnik-Ccaron;ervonenkis dimension is Sp3 -complete

Journal of Computer and System Sciences
Minimum Propositional Proof Length is NP-Hard to Linearly Approximate

MFCS '98 Proceedings of the 23rd International Symposium on Mathematical Foundations of Computer Science
On the Complexity and Inapproximability of Shortest Implicant Problems

ICAL '99 Proceedings of the 26th International Colloquium on Automata, Languages and Programming
Worst-Case Hardness Suffices for Derandomization: A New Method for Hardness-Randomness Trade-Offs

ICALP '97 Proceedings of the 24th International Colloquium on Automata, Languages and Programming
Extracting Randomness: How and Why - A survey

CCC '96 Proceedings of the 11th Annual IEEE Conference on Computational Complexity
Tight bounds for depth-two superconcentrators

FOCS '97 Proceedings of the 38th Annual Symposium on Foundations of Computer Science
Perfect Information Leader Election in log^* n + O(1) Rounds

FOCS '98 Proceedings of the 39th Annual Symposium on Foundations of Computer Science
The Minimum Equivalent DNF Problem and Shortest Implicants

FOCS '98 Proceedings of the 39th Annual Symposium on Foundations of Computer Science
Approximation algorithms for combinatorial problems

STOC '73 Proceedings of the fifth annual ACM symposium on Theory of computing
Graph Ramsey Theory and the Polynomial Hierarchy

Graph Ramsey Theory and the Polynomial Hierarchy
Computing with very weak random sources

SFCS '94 Proceedings of the 35th Annual Symposium on Foundations of Computer Science

Loss-less condensers, unbalanced expanders, and extractors

STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Exact learning of DNF formulas using DNF hypotheses

STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
SIGACT news complexity theory comun 37

ACM SIGACT News
SIGACT news complexity theory column 38

ACM SIGACT News
Extracting all the randomness and reducing the error in Trevisan's extractors

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

Journal of Computer and System Sciences - Complexity 2001
On the Proper Learning of Axis Parallel Concepts

COLT '02 Proceedings of the 15th Annual Conference on Computational Learning Theory
On the proper learning of axis-parallel concepts

The Journal of Machine Learning Research
On the hardness of approximating label-cover

Information Processing Letters
Better extractors for better codes?

STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Simple extractors for all min-entropies and a new pseudorandom generator

Journal of the ACM (JACM)
Beyond NP: the work and legacy of Larry Stockmeyer

Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Exact learning of DNF formulas using DNF hypotheses

Journal of Computer and System Sciences - Special issue on COLT 2002
Linear degree extractors and the inapproximability of max clique and chromatic number

Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
The DNF exception problem

Theoretical Computer Science
Extractors from Reed-Muller codes

Journal of Computer and System Sciences - Special issue on FOCS 2001
On the Complexity of Succinct Zero-Sum Games

Computational Complexity
Hardness of approximate two-level logic minimization and PAC learning with membership queries

Journal of Computer and System Sciences
Framework for evaluating clustering algorithms in duplicate detection

Proceedings of the VLDB Endowment
On approximate horn formula minimization

ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming
The complexity of Boolean formula minimization

Journal of Computer and System Sciences
On obtaining pseudorandomness from error-correcting codes

FSTTCS'06 Proceedings of the 26th international conference on Foundations of Software Technology and Theoretical Computer Science
Optimization problems in the polynomial-time hierarchy

TAMC'06 Proceedings of the Third international conference on Theory and Applications of Models of Computation
Hardness of approximation for quantum problems

ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part I
On the gap between ess(f) and cnf_size(f)

Discrete Applied Mathematics
A complexity and approximability study of the bilevel knapsack problem

IPCO'13 Proceedings of the 16th international conference on Integer Programming and Combinatorial Optimization

Quantified Score

Hi-index	0.00

Visualization

Abstract

We show that a number of natural optimization problems in the second level of the Polynomial Hierarchy are \math hard to approximate to within \math factors, for specific \math. The main technical tool is the use of explicit dispersers to achieve strong, direct inapproximability results. The problems we consider include Succinct Set Cover, Minimum Equivalent DNF, and other problems relating to DNF minimization. Under a slightly stronger complexity assumption, our method gives optimal \math inapproximability results for some of these problems. We also prove inapproximability of a variant of an NP optimization problem, Monotone Minimum Satisfying Assignment, to within an \math factor using the same technique.