Nicolas (Miki) Hermann is at the French Center of Scientific Research (CNRS) in the laboratory of computer science LIX located at Ecole Polytechnique in Paris, France, where he is the head of the Algorithms and Complexity research group. He obtained his PhD from the University of Nancy 1 (now University of Lorraine), in Nancy, France, in 1994. Hermann was a postdoctoral researcher at the University of California, Santa Cruz, from 1994 to 1995. His research interests encompass counting complexity, complexity of constraint satisfaction problems, and complexity of automated deduction. Together with Professor Creignou, he is the author of the first counting complexity dichotomy theorem for Boolean constraint satisfaction problems.
- Counting Complexity and Phase Transitions, Spring 2016. Visiting Scientist.