Name
Abstract | ||
|---|---|---|
Reversible computation is one of the intensively developing research areas nowadays in the field of computer science and engineering. Although the field of reversible circuit synthesis has been studied during the last 15 years few attempts have been published to propose classification of reversible functions. In an earlier paper we considered whether all component functions of a reversible Boolean function either can have the same property in the sense of classical logic synthesis or can belong to the same equivalent class under some equivalence relations. This problem has a direct relationship to studying different aspects of classification of reversible functions. In this paper we present reversible ternary functions of any number of variables with all component functions having the same property or belonging to the same equivalence class. |
Year | DOI | Venue |
|---|---|---|
2017 | 10.1109/ISMVL.2017.54 | 2017 IEEE 47th International Symposium on Multiple-Valued Logic (ISMVL) |
Keywords | Field | DocType |
reversible computation,reversible ternary functions | Boolean function,Discrete mathematics,Equivalence relation,Logic gate,Algebra,Cryptography,Ternary operation,Classical logic,Equivalence class,Mathematics,Computation | Conference |
ISBN | Citations | PageRank |
978-1-5090-5497-8 | 2 | 0.40 |
References | Authors | |
12 | 4 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Pawel Kerntopf | 1 | 156 | 21.89 |
| Krzysztof Podlaski | 2 | 15 | 4.92 |
| Claudio Moraga | 3 | 612 | 100.27 |
| Radomir S. Stankovic | 4 | 188 | 47.07 |