Please use this identifier to cite or link to this item:
http://hdl.handle.net/11701/42036
Title: | Non-deterministic complexity of counting perfect matchings in a graph |
Other Titles: | Недетерминированная сложность подсчета числа совершенных паросочетаний в графе |
Authors: | Михайлин Иван Андреевич Mihajlin Ivan Andreevic Рацеева Ольга Сергеевна Raceeva Olga Sergeevna Куликов Александр Сергеевич Kulikov Aleksandr Sergeevic |
Issue Date: | 2023 |
URI: | http://hdl.handle.net/11701/42036 |
Appears in Collections: | BACHELOR STUDIES |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
st075643.pdf | Article | 348,03 kB | Adobe PDF | View/Open |
reviewSV_st075643_Raceeva_Olga_Sergeevna_(supervisor)(Ru).txt | ReviewSV | 2,61 kB | Text | View/Open |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.