24 search results - page 4 / 5 » focs 1990 |
FOCS
1990
IEEE
13 years 9 months ago
1990
IEEE
The exponent of periodicity is an important factor in estimates of complexity of word-unification algorithms. We prove that the exponent of periodicity of a minimal solution of a w...
FOCS
1990
IEEE
13 years 9 months ago
1990
IEEE
We present several e cient algorithms for sorting on the uniform memory hierarchy UMH, introduced by Alpern, Carter, and Feig, and its parallelization P-UMH. We give optimal and ne...
FOCS
1990
IEEE
13 years 9 months ago
1990
IEEE
We present three alternative simple constructions of small probability spaces on n bits for which any k bits are almost independent. The number of bits used to specify a point in ...
FOCS
1990
IEEE
13 years 9 months ago
1990
IEEE
d abstract) Noga Alon IBM Almaden Research Center, San Jose, CA 95120 and Sackler Faculty of Exact Sciences, Tel Aviv University, Tel Aviv, Israel Moni Naor IBM Almaden Research Ce...
FOCS
2007
IEEE
13 years 12 months ago
2007
IEEE
We show that any k-wise independent probability distribution on {0, 1}n O(m2.22− √ k/10)fools any boolean function computable by an m-clause DNF (or CNF) formula on n variable...