ºù«Ӱҵ

Navid Talebanfard works on computational complexity and through a combinatorial lense he attempts to tackle fundamental problems in circuit complexity and Boolean satisfiability. He has a PhD degree in computer science from Aarhus University and has held postdoctoral positions at Tokyo Institute of Technology, Saarland University, and the Czech Academy of Sciences. He has been a member of various projects including ERC Advanced project FEALORA focusing on logical foundations of complexity theory and randomness.