Miki Hermann

CNRS researcher
Laboratory of Computer Science (LIX)
Ecole Polytechnique, France
E-mail: hermann@lix.polytechnique.fr
Page: http://www.lix.polytechnique.fr/~hermann

Fields of interest:

Computational Complexity

Constraint Satisfaction Problems

Analysis of Algorithms


Recent publications:

A. Durand, M. Hermann and G. Nordh:
Trichotomies in the complexity of minimal inference,
Theory of Computing Systems, to appear in 2011

V. Chepoi, N. Creignou, M. Hermann and G. Salzer:
The Helly property and satisfiability of Boolean formulas defined on set families,
European Journal of Combinatorics, 31(2):502–516, 2010

M. Hermann and R. Pichler:
Counting complexity of propositional abduction,
Journal of Computer and System Sciences, 76(7):634-649, 2010

A. Durand, M. Hermann and G. Nordh:
Trichotomy in the complexity of minimal inference,
In Proceedings of 24th Annual IEEE Symposium on Logic in Computer Science (LICS 2009), Los Angeles (California, USA), pp. 387–396,2009

A. Gil, M. Hermann, G. Salzer and B. Zanuttini:
Efficient algorithms for constraint description problems over finite totally ordered domains,
SIAM Journal on Computing, 38(3):922–945, 2008