On the complexity of multivalued logic functions over some infinite basis

DOI10.1134/S1990478918010052zbMATH Open1413.94079OpenAlexW2791263225WikidataQ130149813 ScholiaQ130149813MaRDI QIDQ4553643FDOQ4553643

Authors: Vadim V. Kochergin, Anna Vital'evna Mikhailovich 

Publication date: 30 October 2018

Published in: Journal of Applied and Industrial Mathematics (Search for Journal in Brave)

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

Recommendations

• Circuit complexity of \(k\)-valued logic functions in one infinite basis
• Depth of functions of the \(k\)-valued logic in infinite bases
• Complexity of implementing functions of k-valued logic by circuits and formulas in functionally complete bases
• Depth of functions of \(k\)-valued logic in finite bases
• On the depth of \(k\)-valued logic functions over arbitrary bases

zbMATH Keywords

inversion complexitylogic circuitinfinite basismulti-valued logic function

Mathematics Subject Classification ID

Cites Work

• Title not available (Why is that?)
• Lattice Theoretic Properties of Frontal Switching Functions
• Boolean function complexity. Advances and frontiers.
• On the complexity of schemes in an infinite basis
• Circuit complexity of symmetric Boolean functions in antichain basis
• Title not available (Why is that?)
• Title not available (Why is that?)
• Orders of growth of Shannon functions for circuit complexity over infinite bases
• Title not available (Why is that?)
• Title not available (Why is that?)
• The power of negations in cryptography
• Learning circuits with few negations
• Algorithms and Computation
• Title not available (Why is that?)
• The minimum number of edges in graphs with prescribed paths
• 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
• Title not available (Why is that?)
• Some properties of Shannon functions

Cited In (11)

• On the depth of \(k\)-valued logic functions over arbitrary bases
• ON LOWER BOUNDS FOR COMPLEXITY OVER INFINITE BASISES FOR FUNCTIONS OF MULTI-VALUED LOGIC
• Depth of functions of the \(k\)-valued logic in infinite bases
• A sequence of functions of the multi-valued logic
• Complexity of functions from some classes of three-valued logic
• Asymptotics of growth for non-monotone complexity of multi-valued logic function systems
• The minimum number of negations in circuits for systems of multi-valued functions
• Complexity of implementing functions of k-valued logic by circuits and formulas in functionally complete bases
• Improvement of nonmonotone complexity estimates of \(k\)-valued logic functions
• Title not available (Why is that?)
• Circuit complexity of \(k\)-valued logic functions in one infinite basis

This page was built for publication: On the complexity of multivalued logic functions over some infinite basis

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