Asymptotics of growth for non-monotone complexity of multi-valued logic function systems
From MaRDI portal
Publication:1685402
Shannon function\(k\)-valued logic functionsMarkov's theoreminversion complexitybases with zero weight elementscircuits complexitycombinational machine (logic circuits)
Recommendations
- On the complexity of multivalued logic functions over some infinite basis
- Circuit complexity of \(k\)-valued logic functions in one infinite basis
- Exact value of the nonmonotone complexity of Boolean functions
- Complexity of implementing functions of k-valued logic by circuits and formulas in functionally complete bases
- Publication:3204441
Cites work
- scientific article; zbMATH DE number 3130282 (Why is no real title available?)
- scientific article; zbMATH DE number 3513337 (Why is no real title available?)
- scientific article; zbMATH DE number 3607492 (Why is no real title available?)
- scientific article; zbMATH DE number 3273218 (Why is no real title available?)
- scientific article; zbMATH DE number 3319974 (Why is no real title available?)
- Algorithms and Computation
- Boolean function complexity. Advances and frontiers.
- Lattice Theoretic Properties of Frontal Switching Functions
- Learning circuits with few negations
- Negation-limited circuit complexity of symmetric functions
- ON THE COMPLEXITY OF CIRCUITS IN BASES CONTAINING MONOTONE ELEMENTS WITH ZERO WEIGHTS
- On the complexity of negation-limited Boolean networks (preliminary version)
- The minimum number of negations in circuits for systems of multi-valued functions
- The power of negations in cryptography
Cited in
(2)
This page was built for publication: Asymptotics of growth for non-monotone complexity of multi-valued logic function systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1685402)
