Multilevel representation and complexity of circuits of unbounded fan-in gates
From MaRDI portal
Publication:2027864
DOI10.3103/S0027132220030055zbMath1495.94166MaRDI QIDQ2027864
Publication date: 28 May 2021
Published in: Moscow University Mathematics Bulletin (Search for Journal in Brave)
Switching theory, applications of Boolean algebras to circuits and networks (94C11) Boolean functions (94D10) Networks and circuits as models of computation; circuit complexity (68Q06)
Cites Work
This page was built for publication: Multilevel representation and complexity of circuits of unbounded fan-in gates