Enumeration of reversible functions and its application to circuit complexity

DOI10.1007/978-3-319-40578-0_19zbMATH Open1480.94055OpenAlexW2494105052MaRDI QIDQ3186605FDOQ3186605

Authors: Mathias Soeken, Nabila Abdessaied, Giovanni De Micheli 

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

Recommendations

• scientific article; zbMATH DE number 2163011
• The classification of reversible bit operations
• Realization and synthesis of reversible functions
• The complexity of the representation of multiple-output Boolean functions
• Computing the number of the equivalence classes for reversible logic functions

zbMATH Keywords

equivalence classpermutation groupreversible 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)

Cites Work

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

Cited In (11)

• On the number of reversible homogeneous structures
• Title not available (Why is that?)
• Title not available (Why is that?)
• An Algorithm for Linear, Affine and Spectral Classification of Boolean Functions
• New Results on Reversible Boolean Functions Having Component Functions with Specified Properties
• Title not available (Why is that?)
• Application of Functional Decomposition in Synthesis of Reversible Circuits
• An approximate algorithm for computing the complexity of reversible functions in the basis of Toffoli
• Computing the number of the equivalence classes for reversible logic functions
• Title not available (Why is that?)
• GENERALIZED COUNTERS AND REVERSAL COMPLEXITY

This page was built for publication: Enumeration of reversible functions and its application to circuit complexity

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3186605)