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
JavaScript is disabled for your browser. Some features of this site may not work without it.
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
Авторефераты диссертаций [18888] Коллекция содержит авторефераты диссертаций, защищенных в Казанском федеральном университете (до 2009 г. Казанский государственный университет)