Linear degree extractors and the inapproximability of max clique and chromatic number

@article{Zuckerman2006LinearDE,
  title={Linear degree extractors and the inapproximability of max clique and chromatic number},
  author={D. Zuckerman},
  journal={Electron. Colloquium Comput. Complex.},
  year={2006}
}
  • D. Zuckerman
  • Published 2006
  • Computer Science, Mathematics
  • Electron. Colloquium Comput. Complex.
A randomness extractor is an algorithm which extracts randomness from a low-quality random source, using some additional truly random bits. We construct new extractors which require only log n + O(1) additional random bits for sources with constant entropy rate. We further construct dispersers, which are similar to one-sided extractors, which use an arbitrarily small constant times log n additional random bits for sources with constant entropy rate. Our extractors and dispersers output 1… Expand
Unbalanced expanders and randomness extractors from
We give an improved explicit construction of highly unbalanced bipartite expander graphs with expansion arbitrarily close to the degree (which is polylogarithmic in the number of vertices). Both theExpand
Unbalanced expanders and randomness extractors from Parvaresh--Vardy codes
TLDR
A new, self-contained construction of randomness extractors that is optimal up to constant factors, while being much simpler than the previous construction of Lu et al. Expand
Extractors and condensers from univariate polynomials
TLDR
The main object is a condenser that loses only the entropy of its seed plus one bit, while condensing to entropy rate 1 i ® for any desired constant ® > 0, and this construction is simple to describe, and has a short and completely self-contained analysis. Expand
Unbalanced expanders and randomness extractors from Parvaresh-Vardy codes
We give an improved explicit construction of highly unbalanced bipartite expander graphs with expansion arbitrarily close to the degree (which is polylogarithmic in the number of vertices). Both theExpand
Extracting randomness using few independent sources
TLDR
This work gives the first deterministic extractors from a constant number of weak sources whose entropy rate is less than 1/2, using a variant of the "stepping-up lemma" used in establishing lower bound on the Ramsey number for hyper-graphs. Expand
Unbalanced Expanders and Randomness Extractors from Parvaresh-Vardy Codes
TLDR
An improved explicit construction of highly unbalanced bipartite expander graphs with expansion arbitrarily close to the degree, which is polylogarithmic in the number of vertices, and a new construction of randomness extractors that is optimal up to constant factors. Expand
Towards optimal two-source extractors and Ramsey graphs
  • Gil Cohen
  • Computer Science, Mathematics
  • STOC
  • 2017
TLDR
An improved construction of an independence-preserving merger (IPM), a variant of the well-studied notion of a merger, which was recently introduced by Cohen and Schulman, that satisfies a stronger and more natural property than that required by the original definition. Expand
Two-Source Extractors for Quasi-Logarithmic Min-Entropy and Improved Privacy Amplification Protocols
  • Gil Cohen
  • Computer Science, Mathematics
  • Electron. Colloquium Comput. Complex.
  • 2016
TLDR
The main technical novelty of this work lies in an improved construction of an independencepreserving merger (IPM) – a variant of the well-studied notion of a merger, that was recently introduced by Cohen and Schulman (FOCS’16). Expand
Existence of Simple Extractors
TLDR
A more sophisticated approach is adopted, using chaining as used by Rudra and Wootters and others, combined with the Beck-Fiala theorem from discrepancy theory to deduce that there are strong extractors outputting a constant number of bits with essentially optimal degree where each seed is a linear function, or even a Toeplitz matrix, or a simply-implementable hash function. Expand
Randomness-Efficient Sampling within NC1
TLDR
A randomness-efficient averaging sampler that is computable by uniform constant-depth circuits with parity gates is constructed, allowing us to apply a variety expander-based techniques within NC1. Expand
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 119 REFERENCES
Towards optimal lower bounds for clique and chromatic number
TLDR
The reductions used to prove these results are extended and combined with a recent result of Samorodnitsky and Trevisan to show that unless NP ⊆ ZPTIME(2O(log n(log log n)3/2), neither Max Clique nor Min Chromatic Number can be approximated in polynomial time within n1-e(n). Expand
Randomness-optimal oblivious sampling
TLDR
This work presents the first efficient oblivious sampler that uses an optimal number of random bits, up to an arbitrary constant factor bigger than 1, and gives applications to constructive leader election and reducing randomness in interactive proofs. Expand
Extracting Randomness via Repeated Condensing
TLDR
This paper constructs explicit condensers with short seed length, which give significant qualitative improvements over previous ones for sources of arbitrary min-entropy; they are nearly optimal simultaneously in the two main parameters of seed length and output length. Expand
Extracting Randomness Using Few Independent Sources
TLDR
The first deterministic extractors from a constant number of weak sources whose entropy rate is less than 1/2 are given, using a variant of the “stepping-up lemma” of Erdods and Hajnal used in establishing a lower bound on the Ramsey number for hypergraphs. Expand
Lossless Condensers, Unbalanced Expanders, And Extractors
TLDR
This paper shows how to use pseudorandom generator constructions to obtain explicit lossless condensers, and obtains new, improved extractors and a new disperser that works for every entropy loss, uses an O(logn) bit seed, and has only O( logn) entropy loss. Expand
Loss-less condensers, unbalanced expanders, and extractors
TLDR
A clean method is given for overcoming this bottleneck by constructing loss-less condensers, which compress the n-bit input source without losing any min-entropy, using O(\log n) additional random bits. Expand
Extractors with weak random seeds
  • R. Raz
  • Computer Science, Mathematics
  • STOC '05
  • 2005
TLDR
The main results are shown how to extract random bits from two or more independent weak random sources in cases where only one source is of linear min-entropy and all other sources are of logarithmic min-ENTropy. Expand
Randomness-Efficient Sampling Within NC1
TLDR
A randomness-efficient averaging sampler that is computable by uniform constant-depth circuits with parity gates is constructed, and an elementary proof of a generalization of Gillman's Chernoff Bound for Expander Walks is given. Expand
Improved inapproximability results for MaxClique, chromatic number and approximate graph coloring
  • Subhash Khot
  • Computer Science
  • Proceedings 2001 IEEE International Conference on Cluster Computing
  • 2001
The author presents improved inapproximability results for three problems: the problem of finding the maximum clique size in a graph, the problem of finding the chromatic number of a graph, and theExpand
Zero knowledge and the chromatic number
  • U. Feige, J. Kilian
  • Mathematics, Computer Science
  • Proceedings of Computational Complexity (Formerly Structure in Complexity Theory)
  • 1996
TLDR
A new technique, inspired by zero-knowledge proof systems, is presented for proving lower bounds on approximating the chromatic number of a graph, and the result matches (up to low order terms) the known gap for approximation the size of the largest independent set. Expand
...
1
2
3
4
5
...