Navid Talebanfard is a Postdoctoral Researcher at the Institute of Mathematics of the Czech Academy of Sciences. He obtained his PhD at Aarhus University under the supervision of Kristoffer Arnsfelt Hansen and Peter Bro Miltersen.
He studies exponential time algorithms for satisfiability problems and circuit complexity.
- Satisfiability: Theory, Practice, and Beyond, Spring 2021. Visiting Postdoc.