Enumeration of reversible functions and its application to circuit complexity (Q3186605)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Enumeration of reversible functions and its application to circuit complexity |
scientific article; zbMATH DE number 6610612
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Enumeration of reversible functions and its application to circuit complexity |
scientific article; zbMATH DE number 6610612 |
Statements
Enumeration of Reversible Functions and Its Application to Circuit Complexity (English)
0 references
10 August 2016
0 references
reversible function
0 references
equivalence class
0 references
permutation group
0 references
reversible circuit complexity
0 references
0 references
0.7983984351158142
0 references
0.7946970462799072
0 references
0.7941001653671265
0 references
0.7883804440498352
0 references
