Zobrazeno 1 - 4
of 4
pro vyhledávání: '"Edinelço Dalcumune"'
Autor:
Edinelço Dalcumune, Luis Antonio Brasil Kowada, André da Cunha Ribeiro, Celina Miraglia Herrera de Figueiredo, Franklin de Lima Marquezino
Publikováno v:
Journal of Universal Computer Science, Vol 27, Iss 6, Pp 544-563 (2021)
We present a new algorithm for synthesis of reversible circuits for arbitrary n-bit bijective functions. This algorithm uses generalized Toffoli gates, which include positive and negative controls. Our algorithm is divided into two parts. First, we u
Externí odkaz:
https://doaj.org/article/10f8e42d094d4a4685de39a3601001ab
Autor:
Edinelço Dalcumune
Publikováno v:
Biblioteca Digital de Teses e Dissertações do LNCCLaboratório Nacional de Computação CientíficaLNCC.
O problema do isomorfismo de grafos possui aplicações em diversas áreas da ciência. Tal problema não possui uma solução eficiente para o seu caso geral. No presente trabalho, apresentamos os conceitos básicos em teoria de grupos, teoria dos g
Externí odkaz:
http://www.lncc.br/tdmc/tde_busca/arquivo.php?codArquivo=152
Autor:
Franklin de Lima Marquezino, Edinelço Dalcumune, Luis Antonio Brasil Kowada, Celina M. H. de Figueiredo, A. C. Ribeiro
Publikováno v:
Journal of Universal Computer Science, Vol 27, Iss 6, Pp 544-563 (2021)
JUCS-Journal of Universal Computer Science 27(6): 544-563
JUCS-Journal of Universal Computer Science 27(6): 544-563
We present a new algorithm for synthesis of reversible circuits for arbitrary n-bit bijective functions. This algorithm uses generalized Toffoli gates, which include positive and negative controls. Our algorithm is divided into two parts. First, we u
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::dee90550713f308f96d91c8a4225fc02
https://doi.org/10.3897/jucs.69617
https://doi.org/10.3897/jucs.69617
Autor:
Luis Antonio Brasil Kowada, Celina M. H. de Figueiredo, Franklin de Lima Marquezino, Edinelço Dalcumune
Publikováno v:
Anais do VI Encontro de Teoria da Computação (ETC 2021).
One of the main motivations for reversible computing is that quantum computing has as one of its foundations the reversibility of all gates, that is, quantum computing circuit models are reversible. An important problem in reversible computing that h
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::f0419c8e233b08abe96821cc2e6d01da
https://doi.org/10.5753/etc.2021.16385
https://doi.org/10.5753/etc.2021.16385