Weizmann Logo
ECCC
Electronic Colloquium on Computational Complexity

Under the auspices of the Computational Complexity Foundation (CCF)

Login | Register | Classic Style



REPORTS > DETAIL:

Paper:

TR15-080 | 7th May 2015 17:48

A simple proof of the Isolation Lemma

RSS-Feed




TR15-080
Authors: Noam Ta-Shma
Publication: 7th May 2015 20:27
Downloads: 2507
Keywords: 


Abstract:

We give a new simple proof for the Isolation Lemma, with slightly better parameters, that also gives non-trivial results even when the weight domain $m$ is smaller than the number of variables $n$.



ISSN 1433-8092 | Imprint