Strongly Universal Reversible Gate Sets

DOI10.1007/978-3-319-40578-0_18zbMath1384.94143arXiv1602.04967OpenAlexW2962891072WikidataQ62045886 ScholiaQ62045886MaRDI QIDQ3186604

Jarkko Kari, Tim Boykett, Jarkko Peltomäki

Publication date: 10 August 2016

Published in: Reversible Computation (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1602.04967

Mathematics Subject Classification ID

Switching theory, applications of Boolean algebras to circuits and networks (94C11)

Related Items (4)

Universal groups of cellular automata ⋮ Finite generating sets for reversible gate sets under general conservation laws ⋮ Transitive action on finite points of a full shift and a finitary Ryan’s theorem ⋮ Universal gates with wires in a row

Cites Work

• Unnamed Item
• Conservative logic
• Towards an algebraic theory of Boolean circuits.
• The Classification of Reversible Bit Operations
• Solutions of the compatibility conditions for a Wigner quantum oscillator

This page was built for publication: Strongly Universal Reversible Gate Sets