Zobrazeno 1 - 6
of 6
pro vyhledávání: '"Aviad Mintz"'
Publikováno v:
Discrete Applied Mathematics. 154:1465-1477
An approach for factoring general boolean functions was described in Golumbic and Mintz [Factoring logic functions using graph partitioning, in: Proceedings of IEEE/ACM International Conference on Computer Aided Design, November 1999, pp. 195–198]
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::07d708ac204318a1ce8f587722f7cd1d
https://doi.org/10.1016/j.dam.2005.09.016
https://doi.org/10.1016/j.dam.2005.09.016
Publikováno v:
Electronic Notes in Discrete Mathematics. 22:357-361
In this paper, we present the first polynomial time algorithm for recognizing and factoring read-once functions. The algorithm is based on algorithms for cograph recognition and a new efficient method for checking normality. Its correctness is based
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::5806d0b986c77099b489c9fc6dce4640
https://doi.org/10.1016/j.endm.2005.06.076
https://doi.org/10.1016/j.endm.2005.06.076
Autor:
Aviad Mintz, Martin Charles Golumbic
Publikováno v:
Discrete Applied Mathematics. 149:131-153
Factoring Boolean functions is one of the basic operations in algorithmic logic synthesis. Current algorithms for factoring Boolean functions are based on some kind of division (Boolean or algebraic). In this paper, we present an algorithm for factor
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::b72a625e89aa5d3286b506350928077d
https://doi.org/10.1016/j.dam.2005.02.007
https://doi.org/10.1016/j.dam.2005.02.007
Publikováno v:
DAC
An approach for factoring general Boolean functions was described [Golumbic, M et al., 1999] which is based on graph partitioning algorithms. In this paper, we present a very fast algorithm for recognizing and factoring read-once functions which is n
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::1bffba046b275a76e5de9a3f07c3fa1f
https://doi.org/10.1145/378239.378356
https://doi.org/10.1145/378239.378356
Publikováno v:
Discrete Applied Mathematics. (10):1633-1636
Read-once functions have gained recent, renewed interest in the fields of theory and algorithms of Boolean functions, computational learning theory and logic design and verification. In an earlier paper [M.C. Golumbic, A. Mintz, U. Rotics, Factoring
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::9f90c79a55e84313ea5cc645dd573d3f
Conference
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.