On the complexity of realizations of Boolean functions in some classes of hypercontact circuits

DOI10.1515/DMA-2024-0004MaRDI QIDQ6548985zbMATH OpenFDO

Authors Yury G. Tarazevich

Publication date 3 June 2024

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

zbMATH Keywords

contact hypergraphcontact matroidcontact-transformer circuithypercontact circuitincidence-linking matrixpolynomial with idempotent variables

Mathematics Subject Classification ID

Combinatorics in computer science (68R05) Positive matrices and their generalizations; cones of matrices (15B48) Switching theory, applications of Boolean algebras to circuits and networks (94C11)

Recommendations

• scientific article; zbMATH DE number 23021
• scientific article; zbMATH DE number 139638
• scientific article; zbMATH DE number 4189653
• scientific article; zbMATH DE number 957589
• A lower bound on the complexity of realization of a Boolean function by two-layer contact circuits on the planar integer lattice

Cites work

• scientific article; zbMATH DE number 420868 (Why is no real title available?)
• scientific article; zbMATH DE number 3133601 (Why is no real title available?)
• scientific article; zbMATH DE number 3736614 (Why is no real title available?)
• scientific article; zbMATH DE number 95249 (Why is no real title available?)
• scientific article; zbMATH DE number 194333 (Why is no real title available?)
• scientific article; zbMATH DE number 3235858 (Why is no real title available?)
• Monotone Boolean functions

This page was built for publication: On the complexity of realizations of Boolean functions in some classes of hypercontact circuits

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