Stefan Dantchev

Dr. Stefan Dantchev is an Assistant Professor in the Department of Computer Science at Durham University. His work focuses on theoretical computer science, particularly proof complexity, computational logic, and parameterized complexity. He has contributed extensively to research on propositional proof systems like Resolution, Sherali-Adams, and Lovász-Schrijver, analyzing their limitations and capabilities through combinatorial principles and optimization techniques. His research also explores sublinear-time algorithms, simplicial complex entropy, and dynamic cellular automata models.

His research interests are centered around proof systems and their computational boundaries, including topics such as binary encoding of combinatorial problems, complexity gaps in QBF Resolution, and the interplay between cutwidth parameters and optimization algorithms. He has investigated foundational questions in computational logic, such as relativization effects on contradiction proofs and the axiomatisation of PageRank in edge-weighted networks.

Dr. Dantchev’s publications span conferences like LATIN, COCOON, and workshops such as STOC and FOCS, alongside journals in computational complexity and combinatorial optimization. His work demonstrates a persistent engagement with core theoretical challenges in computer science, particularly in proof systems and algorithmic efficiency.