Lower bounds of the complexity of symmetric Boolean functions of contact- rectifier circuits

DOI10.1007/BF01240265zbMath0801.68091OpenAlexW1995240561WikidataQ29392665 ScholiaQ29392665MaRDI QIDQ1173769

Alexander A. Razborov

Publication date: 25 June 1992

Published in: Mathematical Notes (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01240265

zbMATH Keywords

lower boundssymmetric Boolean functionsnondeterministic branching programs

Mathematics Subject Classification ID

Related Items (3)

Directed monotone contact networks for threshold functions ⋮ Better lower bounds for monotone threshold formulas ⋮ Natural proofs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Lower bounds of the complexity of symmetric Boolean functions of contact- rectifier circuits