Complexity of realization by formulas of special form for functions of multivalued logic
From MaRDI portal
Publication:355343
DOI10.3103/S0027132213010117zbMATH Open1283.03051OpenAlexW2089642932MaRDI QIDQ355343FDOQ355343
Authors: D. V. Trushchin 
Publication date: 24 July 2013
Published in: Moscow University Mathematics Bulletin (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.3103/s0027132213010117
Recommendations
Cites Work
- Depth of \(\alpha\)-completions of systems of Boolean functions.
- Complexity of realization of functions from a class of three-valued logic by formulas of special type
- Title not available (Why is that?)
- Title not available (Why is that?)
- Examples of α-complete systems of k-valued logic for k = 3, 4
- On α-closed classes and α-complete Systems of k-valued logic functions
Cited In (14)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Mixed id-expansion of multivalued logic functions
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- On the papers of O. M. Kasim-Zade in field of complexity theory and theory of multivalued logics
- A sequence of functions of the multi-valued logic
- Title not available (Why is that?)
- Complexity of functions from some classes of three-valued logic
- On complexity of standard forms for multifunctions
- Complexity of realization of functions from a class of three-valued logic by formulas of special type
- Complexity of implementing functions of k-valued logic by circuits and formulas in functionally complete bases
- Title not available (Why is that?)
This page was built for publication: Complexity of realization by formulas of special form for functions of multivalued logic
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q355343)
