This paper deals with the reversible circuits with n input and
output nodes, consisting of the reversible gates FAN-IN=FAN-OUT<3.
We define a normal form of such type of circuits and describe a reduction
algorithm to transform a circuit in this form. Furthermore we use it for
checking whether two circuits ... more >>>

Producing a small DNF expression consistent with given data is a
classical problem in computer science that occurs in a number of forms and
has numerous applications. We consider two standard variants of this
problem. The first one is two-level logic minimization or finding a minimal
more >>>

For circuit classes R, the fundamental computational problem, Min-R,
asks for the minimum R-size of a boolean function presented as a truth
table. Prominent examples of this problem include Min-DNF, and
Min-Circuit (also called MCSP). We begin by presenting a new reduction
proving that Min-DNF is NP-complete. It is significantly ... more >>>