A Finite Alternation Result for Reversible Boolean Circuits

DOI10.1007/978-3-319-40578-0_20zbMath1480.94054arXiv1604.02549OpenAlexW2962919062MaRDI QIDQ3186606

Peter Selinger

Publication date: 10 August 2016

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

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

Mathematics Subject Classification ID

Quantum computation (81P68) Switching theory, applications of Boolean algebras to circuits and networks (94C11) Boolean functions (94D10)

Cites Work

• Synthesis and optimization of reversible circuits—a survey
• Generating the group of reversible logic gates

This page was built for publication: A Finite Alternation Result for Reversible Boolean Circuits