Kazan Federal University Digital Repository
Complexity and algorithms for obtaining representations of multiple-output boolean functions in polynomial forms and in reversible logic circuits: a thesis abstract submitted for the degree of candidate of sciences (Physics and Mathematics)(translated from Russian): 01.01.09 — discrete math and mathematical cybernetics
- Home
- →
- Авторефераты диссертаций, диссертации
- →
- Авторефераты диссертаций
- →
- View Item
JavaScript is disabled for your browser. Some features of this site may not work without it.
| dc.contributor.author | Frantseva A. S. (Anastasiya S) | |
| dc.date.accessioned | 2021-07-02T20:35:27Z | |
| dc.date.available | 2021-07-02T20:35:27Z | |
| dc.identifier.other | Физико - математические науки | |
| dc.identifier.uri | https://dspace.kpfu.ru/xmlui/handle/net/164118 | |
| dc.language | English | |
| dc.language.iso | en | |
| dc.publisher | Иркутск Иркутский государственный университет 2019 | |
| dc.subject.other | Алгебры функциональные -- Представления -- Авторефераты диссертаций | |
| dc.title | Complexity and algorithms for obtaining representations of multiple-output boolean functions in polynomial forms and in reversible logic circuits: a thesis abstract submitted for the degree of candidate of sciences (Physics and Mathematics)(translated from Russian): 01.01.09 — discrete math and mathematical cybernetics | |
| dc.type | eBook | |
| dc.collection | Основной каталог | |
| dc.source.id | RU05CLSL05CBOOKS030205C63217 | |
| dc.source.id | 42013097 | |
| dc.subject.codVAK | 01.01.09 |
Files in this item
This item appears in the following Collection(s)
-
Авторефераты диссертаций [18888]
Коллекция содержит авторефераты диссертаций, защищенных в Казанском федеральном университете (до 2009 г. Казанский государственный университет)