On bounds for complexity of circuits of multi-input functional elements

DOI10.1515/DMA.2010.005zbMath1194.94210MaRDI QIDQ3586261

Nikolay P. Red'kin

Publication date: 6 September 2010

Published in: Discrete Mathematics and Applications (Search for Journal in Brave)

Mathematics Subject Classification ID

Analytic circuit theory (94C05) Boolean functions (94D10) Networks and circuits as models of computation; circuit complexity (68Q06)

Related Items (1)

The complexity of the parity function in unbounded fan-in, unbounded depth circuits

This page was built for publication: On bounds for complexity of circuits of multi-input functional elements