Amplification by Read-Once Formulas

DOI10.1137/S009753979223633XzbMath0868.94059OpenAlexW2016737198MaRDI QIDQ4337429

Moshe Dubiner, Uri Zwick

Publication date: 17 August 1997

Published in: SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/s009753979223633x

zbMATH Keywords

boundscircuit complexityamplificationBoolean formulamonotone read-once formulasrelays with arbitrarily high reliability

Mathematics Subject Classification ID

Boolean functions (06E30)

Related Items (2)

On linear rewriting systems for Boolean logic and some applications to proof theory ⋮ Associative and commutative tree representations for Boolean functions

This page was built for publication: Amplification by Read-Once Formulas