IEEE Annual Symposium on Foundations of Computer Science · 2023
Cited
1
Resume (English only)
Research Experience
Advisor: Tatyana Turova.
Background
Fifth-year PhD student in theoretical computer science at Lund University. Research interests include computational complexity theory, particularly proof complexity. Particularly interested in understanding the complexity of (random) constraint satisfaction problems.