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.

Uložené v:

Podrobná bibliografia
Vydané v:	Moscow University computational mathematics and cybernetics Ročník 48; číslo 4; s. 225 - 235
Hlavní autori:	Alekseev, V. B., Marchenkov, S. S., Selezneva, S. N.
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Moscow Pleiades Publishing 01.12.2024
Predmet:	Mathematics Mathematics and Statistics complexity valued logic algebraic complexity polynomial closed class algorithm
ISSN:	0278-6419, 1934-8428
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!

Popis
Shrnutí:	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