Please use this identifier to cite or link to this item:
http://hdl.handle.net/11701/42219
Title: | Proof complexity lower bounds of combinatorial principles |
Other Titles: | Нижние оценки сложности вывода комбинаторных принципов |
Authors: | Ицыксон Дмитрий Михайлович Icykson Dmitrij Mihajlovic Овчаров Сергей Дмитриевич Ovcarov Sergej Dmitrievic Куликов Александр Сергеевич Kulikov Aleksandr Sergeevic |
Issue Date: | 2023 |
URI: | http://hdl.handle.net/11701/42219 |
Appears in Collections: | BACHELOR STUDIES |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
st077441.pdf | Article | 515,33 kB | Adobe PDF | View/Open |
reviewSV_Ovcarov___otzyv_rukovoditela.pdf | ReviewSV | 36,85 kB | Adobe PDF | View/Open |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.