Reversible k-valued logic circuits are finitely generated for odd k
classification
💻 cs.ET
math.RAquant-ph
keywords
circuitscommunicationfinitelygeneratedreversiblealgebraicavailableboolean
read the original abstract
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 odd. He cites a private communication for the proof. The purpose of this short note is to make the content of that communication available.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.