On the positive and the inversion complexity of Boolean functions

DOI10.1051/ita/1993270402831zbMath0789.68070OpenAlexW197157737MaRDI QIDQ3142263

Valdas Dičiūnas

Publication date: 15 November 1993

Published in: RAIRO - Theoretical Informatics and Applications (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/92451

zbMATH Keywords

circuit complexityrealization of Boolean functions by circuits

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Related Items

On the computation of Boolean functions by analog circuits of bounded fan-in

Cites Work

• The complexity of the parity function in unbounded fan-in, unbounded depth circuits
• On the Inversion Complexity of a System of Functions
• Unnamed Item
• Unnamed Item
• Unnamed Item