Minimal contact circuits for a sequence of Boolean functions

DOI10.1134/S0001434621070178MaRDI QIDQ2049296zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• scientific article; zbMATH DE number 1285548
• The minimal circuits for linear Boolean functions
• On implementation of Boolean functions by contact circuits of minimal uniform width
• scientific article; zbMATH DE number 850315
• On implementation of Boolean functions by contact circuits with a constant uniform width

Cites work

• scientific article; zbMATH DE number 1285548 (Why is no real title available?)
• Minimal contact circuits for symmetric threshold functions
• Reliability and diagnostics of circuits

Cited in

(5)

• scientific article; zbMATH DE number 6460060 (Why is no real title available?)
• On the synthesis of oriented contact circuits with certain restrictions on adjacent contacts
• On the minimal memory volume that is necessary for realization of boolean function by conveyor boolean circuits
• scientific article; zbMATH DE number 942481 (Why is no real title available?)
• The minimal circuits for linear Boolean functions

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2049296)