A reversible logical circuit synthesis algorithm based on decomposition of cycle representations of permutations (Q1616470): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Synthesis and optimization of reversible circuits—a survey / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Logical Reversibility of Computation / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A new reversible circuit synthesis algorithm based on cycle representations of permutations / rank | |||
Normal rank | |||
Latest revision as of 07:17, 17 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A reversible logical circuit synthesis algorithm based on decomposition of cycle representations of permutations |
scientific article |
Statements
A reversible logical circuit synthesis algorithm based on decomposition of cycle representations of permutations (English)
0 references
6 November 2018
0 references
circuit synthesis
0 references
reversible computing
0 references
cycle representations of permutations
0 references
reversible logic
0 references
