Checking Reversibility of Boolean Functions

DOI10.1007/978-3-319-40578-0_23zbMath1480.94058OpenAlexW2484152397WikidataQ62513066 ScholiaQ62513066MaRDI QIDQ3186609

Aaron Lye, Philipp Niemann, Robert Wille

Publication date: 10 August 2016

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

Full work available at URL: https://doi.org/10.1007/978-3-319-40578-0_23

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Switching theory, applications of Boolean algebras to circuits and networks (94C11) Boolean functions (94D10)

Related Items (2)

Initial Ideas for Automatic Design and Verification of Control Logic in Reversible HDLs ⋮ Unnamed Item

Uses Software

• MiniSat
• RevLib

Cites Work

• Ancilla-free synthesis of large reversible functions using binary decision diagrams
• Efficient manipulation of decision diagrams
• Describing and Optimising Reversible Logic Using a Functional Language
• Graph-Based Algorithms for Boolean Function Manipulation
• Theory and Applications of Satisfiability Testing
• Conflict-Driven Answer Set Enumeration
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Checking Reversibility of Boolean Functions