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ženo v:

Podrobná bibliografie
Vydáno v:	Moscow University computational mathematics and cybernetics Ročník 48; číslo 4; s. 225 - 235
Hlavní autoři:	Alekseev, V. B., Marchenkov, S. S., Selezneva, S. N.
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	Moscow Pleiades Publishing 01.12.2024
Témata:	Mathematics Mathematics and Statistics complexity valued logic algebraic complexity polynomial closed class algorithm
ISSN:	0278-6419, 1934-8428
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!

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