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

Files in this item

This item appears in the following Collection(s)

  • Авторефераты диссертаций [18888]
    Коллекция содержит авторефераты диссертаций, защищенных в Казанском федеральном университете (до 2009 г. Казанский государственный университет)

Search DSpace


Advanced Search

Browse

My Account

Statistics