Mathematical Research Data Initiative
Main page
Recent changes
Random page
SPARQL
MaRDI@GitHub
New item
Special pages
In other projects
MaRDI portal item
Discussion
View source
View history
English
Log in

Cycles-based and transformation-based synthesis of ternary reversible circuits. Aspects of complexity

From MaRDI portal
Publication:5039136
Jump to:navigation, search

MaRDI QIDQ5039136FDOQ5039136


Authors: Caroline Barbieri, Claudio Moraga Edit this on Wikidata


Publication date: 12 October 2022





Recommendations

  • Hybrid GA synthesis of ternary reversible circuits using max-min algebra
  • A reversible logical circuit synthesis algorithm based on decomposition of cycle representations of permutations
  • Universality of 2-qudit ternary reversible gates
  • Realization and synthesis of reversible functions
  • A reversible logic synthesis algorithm based on the transformation of the truth table


Mathematics Subject Classification ID

Mathematical logic and foundations (03-XX)



Cited In (4)

  • On synthesis of 3 × 3 reversible logic functions
  • Hybrid GA synthesis of ternary reversible circuits using max-min algebra
  • A new reversible circuit synthesis algorithm based on cycle representations of permutations
  • Title not available (Why is that?)





This page was built for publication: Cycles-based and transformation-based synthesis of ternary reversible circuits. Aspects of complexity

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5039136)

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:5039136&oldid=19516348"
Tools
What links here
Related changes
Printable version
Permanent link
Page information
This page was last edited on 8 February 2024, at 11:09. Warning: Page may not contain recent updates.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki