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 s
Splitters and near-optimal derandomization (Preliminary Version)
Moni Naor
Leonard J. Schulmany
Aravind Srinivasanz
We present a fairly general method for nding deterministic constructions obeying what we call krestrictions; 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 2k con gurations appear) and families of perfect hash functions. The near-optimal constructions of these objects imply the very e cient derandomization of algorithms in learning, of xed-subgraph nding algorithms, and of near optimal threshold formulae. In addition, they derandomize the reduction showing the hardness of approximation of set cover. They also yield deterministic constructions for a local-coloring protocol, and for exhaustive testing of circuits.
Abstract
Research conducted over the last decades has demonstrated the signi cance of the Probabilistic Method and of probabilistic algorithms and procedures (see 6, 28] for recent reviews of these achievements). However, there are many reasons why one should not be satis ed with a probabilistic construction of an object or with a probabilistic algorithm. This is especially true in cases where there is no procedure for checking the correctness of the result. Also, probabilistic algorithms often behave less satisfactoIncumbent of the Morris and Rose Goldman Career Development Chair, Dept. of Applied Mathematics and Computer Science, Weizmann Institute. Supported by an Alon Fellowship and by a grant from the Israel Science Foundation administered by the Israeli Academy of Sciences. E-mail: naor@wisdom.weizmann.ac.il. y College of Computing, Georgia Inst. Technology, Atlanta GA 30332-0280, USA. Most of this work was done while the author was with the Dept. of Applied Mathematics and Computer Science, Weizmann Institute. E-mail: schulman@cc.gatech.edu. z Dept. of Information Systems& Computer Science, National University of Singapore, Singapore 0511, Republic of Singapore. Most of this work was done while the author was visiting the Dept. of Applied Mathematics and Computer Science, Weizmann Institute. Part of this work was done while visiting the Dept. of Computer Science, University of Warwick, England, supported in part by the ESPRIT Basic Research Action Programme of the EC under contract No. 7141 (project ALCOM II). Part was done while visiting the MaxPlanck-Institut fur Informatik, Saarbrucken, Germany. E-mail: aravind@iscs.nus.sg.
1 Introduction
rily than deterministic ones under recursion, since this can require resource-expensive boosting of the success probability. Hence, a lot of e ort has been devoted to nding ways of removing randomness from algorithms. Unfortunately, the resulting algorithm is often much less e cient than the original one. Exceptions to this are, e.g., the results of 5, 10, 24], where there is
no signi cant penalty in time (or number of processors, in the case of parallel algorithms). The goal of this paper is to present a fairly general method for constructing some combinatorial objects which we call k-restriction collections. All krestriction problems have a probabilistic construction obtained by picking a random collection of vectors. One can show a\union bound" for such a collection (see Section 3.1), and our method achieves deterministic constructions of sizes close to that of the union bound. These constructions in turn allow us to remove the randomness from a large variety of algorithms. A k-restriction problem is, roughly speaking, a collection of vectors of length n over an alphabet of size b such that for any k out the n indices, we will nd some\nice" con gurations; see Section 2.2 for the formal de nition. At the heart of our method are splitters: an (n; k;`)-splitter H is a family of functions from f1;:::; ng to f1;:::;`g such that for all S f1;:::; ng with jS j= k, there is a h 2 H that splits S perfectly, i.e., into equal-sized parts (h?1 (j))\ S, j= 1; 2;:::` (or as equal as possible, if` does not divide k). Splitters themselves fall into the category of k-restriction problems for which our construction is applicable: the alphabet size is` and each vector corresponds to a function h, where the ith entry of the vector is h(i). The nice con gurations for a speci ed k-set S are therefore those where each letter in the alphabet appears the same number of times, when restricted to S. We give here a brief overview of our method. Starting with a universe of size n, we rst reduce our problem to one with a universe of size k2 by nding a poly-time computable family H of (n; k; k2)splitters, i.e., a family H of maps from f1;:::; ng to f1;:::; k2g such that for every k-sized subset S of f1;:::; ng, there is some function in H which is injective on S. A construction for the k2]-sized universe will then be\pulled back" to one on the n]-universe, at a poly(k) log n cost in the size of the family. Next we nd a poly-time computable family of
1.1 Method
Lesson14 Near and Far_计算机软件及应用_IT/计算机_专业资料。Lesson14 Near and Far school near far Talk about it. 2. Is the library far from here?...
--- 3 回复:+++Near & Far[范赫]+++ -2- 宣传活动随着Come Back逐渐展开。 现场签售。 分组进行宣传活动已经不是第一次了,踏上车时习惯性地扫了最后一...
冀教版四年级上册Lesson_14_Near_and_Far课件_四年级英语_英语_小学教育_教育专区。Lesson 14 Near and Far 10/23/2014 What’s this? It’s a 10/23/...
3D simulation of near-... 0人阅读 8页 2.00 Engineering characteri... 1人阅读 6页 2.00 Near-fault ground moti... 5人阅读 9页 2....
Recent Past And Near Future_文化/宗教_人文社科_专业资料 暂无评价0人阅读0次下载举报文档 Recent Past And Near Future_文化/宗教_人文社科_专业资料。...
托福阅读 26-3 Sumer and the First Cities of the Ancient Near East_英语考试_外语学习_教育专区。www.pgeducation.com Sumer and the First Cities of the...
冀教版四年级上册Lesson_14_Near_and_Far课件_英语_小学教育_教育专区。Lesson 14 Near and Far What’s this? It’s a playground. What’s this? It’...
velocity mismatch between the near-infrared probe beam and the THz radiation... into pump and probe beams by a 1-mmthick glass-plate beam splitter. ...
So near and yet so far AT DAWN on September 16th 1810 Miguel Hidalgo, the parish priest of Dolores, a small town in central Mexico, rang the bells...
热门文档