Results from the Department of Mathematical Cybernetics in the Field of Discrete Structures and Algorithm Complexity

The author presents some of the most important results obtained at the Department of Mathematical Cybernetics by Profs. V.B. Alekseev, S.S. Marchenkov, S.N. Selezneva, and their post- and graduate students since the start of the 21st century.

Saved in:

Bibliographic Details
Published in:	Moscow University computational mathematics and cybernetics Vol. 48; no. 4; pp. 225 - 235
Main Authors:	Alekseev, V. B., Marchenkov, S. S., Selezneva, S. N.
Format:	Journal Article
Language:	English
Published:	Moscow Pleiades Publishing 01.12.2024
Subjects:	Mathematics Mathematics and Statistics complexity valued logic algebraic complexity polynomial closed class algorithm
ISSN:	0278-6419, 1934-8428
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Description
Summary:	The author presents some of the most important results obtained at the Department of Mathematical Cybernetics by Profs. V.B. Alekseev, S.S. Marchenkov, S.N. Selezneva, and their post- and graduate students since the start of the 21st century.
ISSN:	0278-6419 1934-8428
DOI:	10.3103/S027864192470016X