Frantseva Anastasiya Sergeevna

Presentations in Math-Net.Ru

1. An Approximate Algorithm for Finding the Complexity of Reversible Implementations Boolean Functions’ Extended Kronecker Forms
   S. F. Vinokurov, A. S. Frantseva
   International workshop "Syntax and semantics of logical systems"
   August 15, 2019 12:30
2. 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»
   A. S. Frantseva
   International workshop "Syntax and semantics of logical systems"
   August 12, 2019 15:00