311 citations · 1.2k across the 38 of their papers we have counts for
Showing 2016 · cs.ETShow all
2 papers · 2 filters
cs.ET2016★ 2 cited
Reversible k-valued logic circuits are finitely generated for odd k
Peter Selinger
In his 2003 paper "Towards an algebraic theory of Boolean circuits", Lafont notes that the class of reversible circuits over a set of k truth values is finitely generated when k is…
cs.ET2016★ 4 cited
A finite alternation result for reversible boolean circuits
Peter Selinger
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…