Presentation of PhD thesis on the topic «Complexity and Algorithms for Obtaining Representations of Multiple-output Boolean Functions in Polynomial Forms and in Reversible Logic Circuits»

The report is devoted to a review of the dissertation research’s results for the degree of Candidate of Sciences (Physics and Mathematics) in the specialty 01.01.09 — Discrete mathematics and mathematical cybernetics on the topic "Complexity and Algorithms for Obtaining Representations of Multiple-output Boolean Functions in Polynomial Forms and in Reversible Logic Circuits."