Bounds of non-monotone complexity for the multi-valued logic functions
The non-monotone complexity of realization of k-valued logic functions by circuits in a special basis was investigated. The basis consists of elements of two types: the first type comprises all monotone functions (with respect to the order 0 < 1 < 2 <···< k−1 ) with zero weight; the seco...
Saved in:
| Main Authors: | V.V. Kochergin, A.V. Mikhailovich |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Kazan Federal University
2020-09-01
|
| Series: | Учёные записки Казанского университета: Серия Физико-математические науки |
| Subjects: | |
| Online Access: | https://kpfu.ru/uz-eng-phm-2020-3-6.html |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
Algorithms for partitioning logical circuits into subcircuits
by: N. A. Kirienko
Published: (2020-09-01) -
A Low Complexity Multi-Valued Logic Successor and Predecessor in Nanoelectronics
by: Yousef Pendashteh, et al.
Published: (2024-04-01) -
Logical characterization of complexity class of problems solvable by probablistic algorithms in polynomial time
by: V. G. Naidenko
Published: (2018-12-01) -
Terahertz All-Optical Logic Gates Based on a Graphene Nanoribbon Rectangular Ring Resonator
by: Wei Su, et al.
Published: (2018-01-01) -
Efficient design of 15:4 counter using a novel 5:3 counter for high‐speed multiplication
by: Hemanth Krishna L., et al.
Published: (2021-01-01)