## Abstract

We construct a small set of explicit linear transformations mapping ℝ ^{n} to ℝ ^{t}, where t = O(log(γ-1)ε ^{-2}), such that the L _{2} norm of any vector in ℝ ^{n} is distorted by at most 1 ± ε in at least a fraction of 1-γ of the transformations in the set. Albeit the tradeoff between the size of the set and the success probability is suboptimal compared with probabilistic arguments, we nevertheless are able to apply our construction to a number of problems. In particular, we use it to construct an ε-sample (or pseudorandom generator) for linear threshold functions on S ^{n-1} for ε = o(1). We also use it to construct an ε-sample for spherical digons in S ^{n-1} for ε = o(1). This construction leads to an efficient oblivious derandomization of the Goemans-Williamson Max-Cut algorithm and similar approximation algorithms (i.e., we construct a small set of hyperplanes such that for any instance we can choose one of them to generate a good solution). Our technique for constructing an ε-sample for linear threshold functions on the sphere is considerably different than previous techniques that rely on k-wise independent sample spaces.

Original language | American English |
---|---|

Pages (from-to) | 219-249 |

Number of pages | 31 |

Journal | SIAM Journal on Computing |

Volume | 41 |

Issue number | 1 |

DOIs | |

State | Published - 2012 |

## Keywords

- Digons
- Dimension reduction
- Johnson Lindenstrauss
- Linear threshold functions
- Max-Cut
- Pseudorandom generator