An algorithm for minimization of Boolean functions in the class of Toffoli reversible logic circuits (Q1717423): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: An approximate algorithm for computing the complexity of reversible functions in the basis of Toffoli / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The complexity of the representation of multiple-output Boolean functions / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q2748260 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: MMIXware. A RISC computer for the third millennium. / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Conservative logic / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3886867 / rank | |||
Normal rank | |||
Latest revision as of 01:49, 18 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An algorithm for minimization of Boolean functions in the class of Toffoli reversible logic circuits |
scientific article |
Statements
An algorithm for minimization of Boolean functions in the class of Toffoli reversible logic circuits (English)
0 references
5 February 2019
0 references
reversible circuit
0 references
Toffoli functions
0 references
Boolean functions
0 references
polarized zhegalkin polynomials or Reed-Muller forms
0 references
0 references
