Young subgroups for reversible computers.
From MaRDI portal
Publication:935622
DOI10.3934/amc.2008.2.183zbMath1175.94129OpenAlexW1998923851MaRDI QIDQ935622
Yvan Van Rentergem, Alexis De Vos
Publication date: 12 August 2008
Published in: Advances in Mathematics of Communications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.3934/amc.2008.2.183
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (9)
Complexity of reversible circuits and their quantum implementations ⋮ A Fast Symbolic Transformation Based Algorithm for Reversible Logic Synthesis ⋮ Conjectured \textit{DXZ} decompositions of a unitary matrix ⋮ Exact Synthesis of ESOP Forms ⋮ Upper bounds for reversible circuits based on Young subgroups ⋮ Ancilla-free synthesis of large reversible functions using binary decision diagrams ⋮ Translation Techniques for Reversible Circuit Synthesis with Positive and Negative Controls ⋮ Technology Mapping for Single Target Gate Based Circuits Using Boolean Functional Decomposition ⋮ Evaluating ESOP Optimization Methods in Quantum Compilation Flows
This page was built for publication: Young subgroups for reversible computers.
