Minimal contact circuits for a sequence of Boolean functions

DOI10.1134/S0001434621070178zbMath1497.94202OpenAlexW3195704069MaRDI QIDQ2049296

Nikolay P. Red'kin

Publication date: 25 August 2021

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

Full work available at URL: https://doi.org/10.1134/s0001434621070178

zbMATH Keywords

Boolean functioncontact circuitcomplexity of circuit

Mathematics Subject Classification ID

Switching theory, applications of Boolean algebras to circuits and networks (94C11) Networks and circuits as models of computation; circuit complexity (68Q06)

Cites Work

• Minimal contact circuits for symmetric threshold functions
• Unnamed Item
• Unnamed Item

This page was built for publication: Minimal contact circuits for a sequence of Boolean functions