Complexity of representation of Boolean function polynomials by revesable circuits

Abstract:

The paper considers the complexity of representations of Boolean functions in classes of reversible circuits and polynomial forms.

Keywords:

Boolean functions, polynomials, reversible circuits

Publication language: russian, pages: 2 (p. 125-126)

Russian source text:

List of publications citation:

Export link to publication in format:

About authors:

Vinokurov Sergey Fyodorovich,

Muratov Vladislav Andreevich,