Splitters and near-optimal derandomization

@article{Naor1995SplittersAN,
  title={Splitters and near-optimal derandomization},
  author={Moni Naor and Leonard J. Schulman and Aravind Srinivasan},
  journal={Proceedings of IEEE 36th Annual Foundations of Computer Science},
  year={1995},
  pages={182-191}
}
We present a fairly general method for finding deterministic constructions obeying what we call k-restrictions; this yields structures of size not much larger than the probabilistic bound. The structures constructed by our method include (n,k)-universal sets (a collection of binary vectors of length n such that for any subset of size k of the indices, all 2/sup k/ configurations appear) and families of perfect hash functions. The near-optimal constructions of these objects imply the very… Expand
Derandomizing Non-uniform Color-Coding I
TLDR
(n, k, l)universal sets that are typically smaller and can be constructed faster are introduced that are still sufficient for derandomization and faster deterministic algorithms can be obtained. Expand
Algorithmic construction of sets for k-restrictions
TLDR
This work addresses k-restriction problems, which unify combinatorial problems of the following type, and offers a generic algorithmic method that yields considerably smaller constructions. Expand
On the parameterized complexity of k-SUM
TLDR
These results effectively resolve the parameterized complexity of k-SUM, initially posed in 1992 by Downey and Fellows in their seminal paper on parameterized intractability. Expand
MODp-tests, Almost Independence and Small Probability Spaces (Extended Abstract)
TLDR
An approach to estimate the quality of approximations towards the construction of small probability spaces which are used to derandomize algorithms, and for reasonably small p, the authors get smaller sample spaces. Expand
Balanced Hashing, Color Coding and Approximate Counting
TLDR
It is shown that every perfectly k-balanced family is of size at least $c(k) n^{\lfloor k/2 \rfloor}$, and that for every $\epsilon>\frac{1}{poly(k)}$ there are explicit constructions of (?,k)-balanced families of hash functions from [n] to [k] of size e (1 + o(1))k logn. Expand
Designing FPT Algorithms for Cut Problems Using Randomized Contractions
TLDR
It is shown that one can in polynomial time solve instances of Unique Games where the number of edges allowed not to be satisfied is upper bounded by $O(\sqrt{\log n})$ to optimality, which improves over the trivial $O(1)$ upper bound. Expand
Parallel Algorithms via the Probabilistic Method
TLDR
The intention of this paper is to show the development of the method of k-wise independence in a straightforward way, starting with appli- cations where constant independence is sufficient, passing applications of log- n -wise independence like discrepancy problems and reaching the applications to integer pro- gramming. Expand
Adaptive versus nonadaptive attribute-efficient learning
TLDR
A graph-theoretic characterization of nonadaptive learning families, called r-wise bipartite connected families, are given and it is proved that the optimal query number O(2r + r log n) can be already achieved in O(r) stages. Expand
Adaptive Versus Nonadaptive Attribute-Efficient Learning
  • P. Damaschke
  • Mathematics, Computer Science
  • Machine Learning
  • 2004
TLDR
A graph-theoretic characterization of nonadaptive learning families, called r-wise bipartite connected families, are given and it is proved that the optimal query number O(2r + r log n) can be already achieved in O(r) stages. Expand
Parameterized Complexity of Eulerian Deletion Problems
TLDR
A randomized FPT algorithm for making an undirected graph Eulerian by deleting the minimum number of edges, based on a novel application of the color coding technique is shown, proving that this is not possible unless NP⊆coNP/poly. Expand
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 71 REFERENCES
On the Size of Separating Systems and Families of Perfect Hash Functions
This paper presents two applications of an interesting information theoretic theorem about graphs. The first application concerns the derivation of good bounds for the function $Y(b,k,n)$, which isExpand
Fredman-Kolmo´s bounds and information theory
Fredman and Komlos have applied an interesting information-theoretic lemma to two problems in combinatorics. They have derived good lower bounds on the minimum size of a family of partitions of anExpand
Color-coding: a new method for finding simple paths, cycles and other small subgraphs within large graphs
TLDR
A novel randomized method, the method of color-coding for finding simple paths and cycles of a specified length k, and other small subgraphs, within a given graph G = (V,E), which can be derandomized using families of perfect hash functions. Expand
Efficient probabilistically checkable proofs and applications to approximations
TLDR
This work constructs multi-prover proof systems for NP which use only a constant number of provers to simultaneously achieve low error, low randomness and low answer size, and shows that approximating minimum set cover within any constant is NP-complete. Expand
The Spatial Complexity of Oblivious k-Probe Hash Functions
TLDR
Nearly tight bounds on the spatial complexity of oblivious $O(1)$-probe hash functions, which are defined to depend solely on their search key argument are provided, establishing a significant gap between oblivious and nonoblivious search. Expand
Removing Randomness in Parallel Computation without a Processor Penalty
  • M. Luby
  • Computer Science
  • J. Comput. Syst. Sci.
  • 1993
TLDR
A parallel algorithm for the Delta +1 vertex coloring problem with running time O(log/sup 3/ nlog log n) using a linear number of processors on a concurrent-read-concurrent-write parallel random-access machine. Expand
A Fast and Simple Randomized Parallel Algorithm for the Maximal Independent Set Problem
TLDR
A technique due to A. Joffe (1974) is applied and deterministic construction in fast parallel time of various combinatorial objects whose existence follows from probabilistic arguments is obtained. Expand
Simple Construction of Almost k-wise Independent Random Variables
TLDR
This work presents three alternative simple constructions of small probability spaces on n bits for which any k bits are almost independent and their simplicity is their simplicity. Expand
Improved Bounds for Covering Complete Uniform Hypergraphs
TLDR
For small values of r, the result implies a lower bound of Ω(( e r r r )n log n) on the size of any such covering, which improves the previous bound ofΩ(rnlog n) due to Snir. Expand
Efficient NC Algorithms for Set Cover with Applications to Learning and Geometry
TLDR
The set cover algorithm is applied to learning theory, providing an NC algorithm for learning the concept class obtained by taking the closure under finite union or finite intersection of any concept class of finite VC dimension which has an NC hypothesis finder. Expand
...
1
2
3
4
5
...