Amplification and percolation (probabilistic Boolean functions)

DOI10.1109/SFCS.1992.267766zbMath1115.94309MaRDI QIDQ4230348

Uri Zwick, Moshe Dubiner

Publication date: 1 March 1999

Published in: Proceedings., 33rd Annual Symposium on Foundations of Computer Science (Search for Journal in Brave)

Mathematics Subject Classification ID

Boolean functions (06E30)

Related Items (4)

Directed monotone contact networks for threshold functions ⋮ Better lower bounds for monotone threshold formulas ⋮ On the shrinkage exponent for read-once formulae ⋮ Using amplification to compute majority with small majority gates

This page was built for publication: Amplification and percolation (probabilistic Boolean functions)