Enumeration of Reversible Functions and Its Application to Circuit Complexity

DOI10.1007/978-3-319-40578-0_19zbMath1480.94055OpenAlexW2494105052MaRDI QIDQ3186605

Nabila Abdessaied, Giovanni De Micheli, Mathias Soeken

Publication date: 10 August 2016

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

Full work available at URL: https://infoscience.epfl.ch/record/218884/files/2016_rc_2.pdf

zbMATH Keywords

permutation groupequivalence classreversible functionreversible circuit complexity

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) General theory for finite permutation groups (20B05) Switching theory, applications of Boolean algebras to circuits and networks (94C11) Boolean functions (94D10)

Related Items (4)

Computing the number of the equivalence classes for reversible logic functions ⋮ An Algorithm for Linear, Affine and Spectral Classification of Boolean Functions ⋮ New Results on Reversible Boolean Functions Having Component Functions with Specified Properties ⋮ Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• White Dots do Matter: Rewriting Reversible Logic Circuits
• Equivalence classes of invertible Boolean functions
• A Study of Optimal 4-Bit Reversible Toffoli Circuits and Their Synthesis
• The Number of Classes of Invertible Boolean Functions
• Detection of Total or Partial Symmetry of a Switching Function with the Use of Decomposition Charts
• On the Classification of Boolean Functions by the General Linear and Affine Groups
• Invertible Boolean Functions
• The Number of Transitivity Sets of Boolean Functions
• On The Number of Symmetry Types of Boolean Functions of n Variables

This page was built for publication: Enumeration of Reversible Functions and Its Application to Circuit Complexity