Asymptotics of growth for non-monotone complexity of multi-valued logic function systems

DOI10.17377/semi.2017.14.093zbMath1386.94119MaRDI QIDQ1685402

Anna Vital'evna Mikhailovich, Vadim V. Kochergin

Publication date: 13 December 2017

Published in: Sibirskie Èlektronnye Matematicheskie Izvestiya (Search for Journal in Brave)

zbMATH Keywords

Shannon function\(k\)-valued logic functionsMarkov's theoreminversion complexitybases with zero weight elementscircuits complexitycombinational machine (logic circuits)

Mathematics Subject Classification ID

Related Items (2)

Improvement of nonmonotone complexity estimates of \(k\)-valued logic functions ⋮ Circuit complexity of \(k\)-valued logic functions in one infinite basis

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Boolean function complexity. Advances and frontiers.
• Negation-limited circuit complexity of symmetric functions
• The minimum number of negations in circuits for systems of multi-valued functions
• On the complexity of negation-limited Boolean networks
• ON THE COMPLEXITY OF CIRCUITS IN BASES CONTAINING MONOTONE ELEMENTS WITH ZERO WEIGHTS
• Algorithms and Computation
• The Power of Negations in Cryptography
• Learning circuits with few negations
• Lattice Theoretic Properties of Frontal Switching Functions

This page was built for publication: Asymptotics of growth for non-monotone complexity of multi-valued logic function systems