On the Structure, Complexity, and Depth of the Circuits over the Basis {&, ∨} Realizing Step Boolean Functions

The step Boolean function is a function of the algebra of logic of n Boolean variables, n = 1, 2, … , reducing to 1 on all of the sets of an n -dimensional unit cube, the ordinal numbers of which are not lower than the given set. In this paper, the problem of synthesis of circuits over the basis {&a...

Full description

Bibliographic Details

Published in:	Učënye zapiski Kazanskogo universiteta. Seriâ Fiziko-matematičeskie nauki Vol. 162; no. 3; pp. 335 - 349
Main Authors:	Lozhkin, S.A., Kinzhikeyeva, D.S.
Format:	Journal Article
Language:	English
Published:	Kazan Federal University 01.01.2020
Subjects:	basis {& ∨} boolean circuits complexity and depth minimization step boolean functions structure of minimal circuits
ISSN:	2541-7746, 2500-2198
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!