Paper Info
Title
A Finite Alternation Result For Reversible Boolean Circuits
Abstract
We say that a reversible boolean function on n bits has alternation depth d if it can be written as the sequential composition of d reversible boolean functions, each of which acts only on the top n - 1 bits or on the bottom n - 1 bits. We show that every reversible boolean function of n >= 4 bits has alternation depth 9.
Year
DOI
Venue
2016
10.1007/978-3-319-40578-0_20
REVERSIBLE COMPUTATION, RC 2016
DocType
Volume
ISSN
Conference
9720
0302-9743
Citations 
PageRank 
References 
2
0.43
2
Authors
1
Name
Order
Citations
PageRank
Peter Selinger143436.65