Zobrazeno 1 - 10
of 60
pro vyhledávání: '"zhegalkin polynomial"'
Autor:
Leonid Y. Bystrov, Egor V. Kuzmin
Publikováno v:
Моделирование и анализ информационных систем, Vol 30, Iss 2, Pp 106-127 (2023)
Among functionally complete sets of Boolean functions, sole sufficient operators are of particular interest. They have a wide range of applicability and are not limited to the two-seat case. In this paper, the conditions, imposed on the Zhegalkin pol
Externí odkaz:
https://doaj.org/article/e9539d96d9b541d1b47a40f753dc048f
Autor:
S.N. Selezneva, A. A. Lobanov
Publikováno v:
Известия Иркутского государственного университета: Серия "Математика", Vol 33, Iss 1, Pp 96-105 (2020)
Minimization of Boolean functions in their various representations is required in logic design of digital devices. EXOR sums (polynomial forms) are considered among other representations. An EXOR sum (a polynomial form) is an expression that is an EX
Externí odkaz:
https://doaj.org/article/11764b5ea70c4431accbe3f5c2b9931b
Akademický článek
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.
Akademický článek
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.
Autor:
I. Ya. Spectorsky, O. A. Galganov
Publikováno v:
System research and information technologies. :129-145
Introduced by Soviet scientist I. Zhegalkin in 1927, Zhegalkin polynomial is a way to represent a Boolean function as an exclusive or of conjunctions of variables. One of the known algorithms for constructing Zhegalkin polynomial is so called ‘tria
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::e98311523cd83f0be38c22d9f9eb0ce3
https://doi.org/10.20535/srit.2308-8893.2020.1.12
https://doi.org/10.20535/srit.2308-8893.2020.1.12
Publikováno v:
Russian Microelectronics. 49:1-15
The fundamental relationship between quantum physics and discrete mathematics is examined. A method for representing Boolean functions in the form of unitary transformations is described. The question of the connection of Zhegalkin polynomials defini
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::e5f8cc172d86e980f11b178b8b12df0e
https://doi.org/10.1134/s1063739720010047
https://doi.org/10.1134/s1063739720010047
It is shown that solving the problem of the essence of intelligence (including human intelligence) is key for the further development of artificial intelligence systems. Based on the consideration of human intelligence as a complexly structured infor
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::8bf19182eef335266999a91a77938a5a
Autor:
R. I. Dzerjinsky
Publikováno v:
Lecture Notes in Networks and Systems ISBN: 9783030903206
The as you know, in discrete mathematics there is no limit concept, but there is a function denoted by the term derivative. This is due to the Boolean function expansion in a series similar to the Maclaurin series at the point 00… 0 or the Taylor s
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::e9168db5e67c0a833d02d82c3d09f1d7
https://doi.org/10.1007/978-3-030-90321-3_10
https://doi.org/10.1007/978-3-030-90321-3_10
Autor:
Sergei Borzunov, Sergei Kurgalin
Publikováno v:
Texts in Computer Science ISBN: 9783030650513
The main task of classical computations is the computation of functions defined in analytical or tabular form. Let us start with Boolean functions that depend on several arguments. The implementation of Boolean functions with a quantum computer is ba
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::5c1b2eb6e9885e98a39dc2b08359ccef
https://doi.org/10.1007/978-3-030-65052-0_7
https://doi.org/10.1007/978-3-030-65052-0_7
Akademický článek
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.