Balanced boolean functions that can be evaluated so that every input bit is unlikely to be read
From MaRDI portal
Publication:3581394
DOI10.1145/1060590.1060627zbMath1192.68851arXivmath/0410282MaRDI QIDQ3581394
Oded Schramm, Itai Benjamini, David Bruce Wilson
Publication date: 16 August 2010
Published in: Proceedings of the thirty-seventh annual ACM symposium on Theory of computing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/math/0410282
Related Items
Upper bounds on the one-arm exponent for dependent percolation models, Noise sensitivity in continuum percolation, Oded Schramm's contributions to noise sensitivity, Query complexity in errorless hardness amplification, Quantitative noise sensitivity and exceptional times for percolation, Boolean function metrics can assist modelers to check and choose logical rules