Exact value of the nonmonotone complexity of Boolean functions

DOI10.1134/S0001434619010048zbMath1411.94115OpenAlexW2937666310MaRDI QIDQ2313604

Anna Vital'evna Mikhailovich, Vadim V. Kochergin

Publication date: 19 July 2019

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

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

zbMATH Keywords

circuit complexityinversion complexitycircuits of functional elementsnonmonotone complexityBoolean (logical) circuits

Mathematics Subject Classification ID

Related Items (1)

Improvement of nonmonotone complexity estimates of \(k\)-valued logic functions

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Boolean function complexity. Advances and frontiers.
• The minimum number of negations in circuits for systems of multi-valued functions
• ON THE COMPLEXITY OF CIRCUITS IN BASES CONTAINING MONOTONE ELEMENTS WITH ZERO WEIGHTS
• The Power of Negations in Cryptography
• Learning circuits with few negations

This page was built for publication: Exact value of the nonmonotone complexity of Boolean functions