A reversible logical circuit synthesis algorithm based on decomposition of cycle representations of permutations (Q1616470): Difference between revisions
From MaRDI portal
Changed an Item |
ReferenceBot (talk | contribs) Changed an Item |
||
(2 intermediate revisions by 2 users not shown) | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1007/s10773-018-3768-5 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2804305837 / rank | |||
Normal rank | |||
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