Amplification and percolation (probabilistic Boolean functions)

DOI10.1109/SFCS.1992.267766MaRDI QIDQ4230348zbMATH OpenFDO

Authors Moshe Dubiner, Uri Zwick

Publication date 1 March 1999

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

Full work available at URL https://doi.org/10.1109/SFCS.1992.267766

Mathematics Subject Classification ID

Boolean functions (06E30)

Recommendations

• Amplification by Read-Once Formulas
• Amplification of Bounded Depth Monotone Read-Once Boolean Formulae
• Using amplification to compute majority with small majority gates
• How Do Read-Once Formulae Shrink?

Cited in

(6)

• Directed monotone contact networks for threshold functions
• Better lower bounds for monotone threshold formulas
• On the shrinkage exponent for read-once formulae
• Percolation in the signal to interference ratio graph
• Amplification by Read-Once Formulas
• Using amplification to compute majority with small majority gates

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4230348)