Persons: Frantseva, Anastasiya Sergeevna

Persons

RUS ENG

JavaScript is disabled in your browser. Please switch it on to enable full functionality of the website

Frantseva, Anastasiya Sergeevna

E-mail:

Keywords:

reversible computing, Toffolli, reversible function, complexity, parallel algorithms.

Subject:

The complexity of Boolean functions in the class of reversible circuits. Parallel algorithms of reversible functions.

Main publications:

S. F. Vinokurov, A. S. Frantseva, “Priblizhennyi algoritm vychisleniya slozhnosti obratimoi funktsii v bazise Toffoli”, Izvestiya Irkutskogo gosudarstvennogo universiteta, 4:4 (2011), 12–26

	Publications in Math-Net.Ru	Citations
	2019
1.	A. S. Frantseva, “Complexity of Boolean functions' representations in classes of extended pair-generated operator forms”, Sib. Èlektron. Mat. Izv., 16 (2019), 523–541	1
	2018
2.	A. S. Frantseva, “An algorithm for minimization of Boolean functions in the class of Toffoli reversible logic circuits”, Bulletin of Irkutsk State University. Series Mathematics, 25 (2018), 144–158
	2016
3.	S. F. Vinokurov, A. S. Frantseva, “The complexity of the representation of multiple-output Boolean functions”, Bulletin of Irkutsk State University. Series Mathematics, 16 (2016), 30–42	1
	2011
4.	S. F. Vinokurov, A. S. Frantseva, “An approximate algorithm for computing the complexity of reversible functions in the basis of Toffoli”, Bulletin of Irkutsk State University. Series Mathematics, 4:4 (2011), 12–26	2

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

Organisations