On the complexity and depth of circuits that realize partial Boolean functions

DOI10.1515/dma.1997.7.2.113zbMath0886.94023OpenAlexW1969432141MaRDI QIDQ4367622

A. V. Chashkin

Publication date: 28 January 1998

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

Full work available at URL: https://doi.org/10.1515/dma.1997.7.2.113

zbMATH Keywords

complexitydepthcircuitspartial Boolean functions

Mathematics Subject Classification ID

Boolean functions (06E30)

This page was built for publication: On the complexity and depth of circuits that realize partial Boolean functions