Complexity of realization of a linear Boolean function in Sheffer's basis

DOI10.3103/S0027132213020083zbMath1298.94163MaRDI QIDQ355321

Yu. A. Kombarov

Publication date: 24 July 2013

Published in: Moscow University Mathematics Bulletin (Search for Journal in Brave)

zbMATH Keywords

Sheffer strokelinear Boolean functionsrealization by circuits of functional elements

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Switching theory, applications of Boolean algebras to circuits and networks (94C11) Boolean functions (94D10)

Related Items (2)

The generalized complexity of linear Boolean functions ⋮ Polynomial-time quantum algorithms for finding the linear structures of Boolean function

Cites Work

• The minimal circuits for linear Boolean functions
• Unnamed Item

This page was built for publication: Complexity of realization of a linear Boolean function in Sheffer's basis