معرفی
Demian Banakh is affiliated with the Department of Algorithmics at the Faculty of Mathematics and Computer Science, Jagiellonian University. His research focuses on quantum computing and computational complexity, as evidenced by his work on quantum CSP strategies and hardness conditions for promise constraint satisfaction problems (PCSPs). He completed a Master's thesis titled "Dichotomies for Boolean minions of weighted-sum functions with threshold." Banakh is part of the Algorithmics Research Group and collaborates with researchers like Marcin Kozik. His publications appear in prestigious conferences such as IEEE Symposium on Logic in Computer Science (LICS).
He is involved in academic administration, contributing to technical infrastructure (e.g., university WiFi access management) and maintaining departmental resources. Contact details include room 3148 at the department, though an explicit email address is not provided in the text.
