Get started
Author

Miki Hermann

Observed names: Georg Gottlob, Miki Hermann, Mich�el Rusinowitch, Guest Editors, Hermann, M., Hermann, Miki, M. Hermann, Miki Hermann Andrei Voronkov (eds
Observed institutions: Centre National de la Recherche Scientifique, Institut national de recherche en sciences et technologies du numérique, École Polytechnique, University of California, Santa Cruz, Laboratoire Lorrain de Recherche en Informatique et ses Applications, Laboratoire d'Informatique de l'École Polytechnique, Institut Polytechnique de Paris, Université Henri Poincaré, Technical University of Munich, Carnegie Mellon University
ORCID: 0000-0003-2517-2127
Observed ORCID: 0000-0003-2517-2127
OpenAlex ID: A5074896214
Complexity of Generalized Satisfiability Counting Problems
1996 · Nadia Creignou, Miki Hermann · Information and Computation · 182
Subtractive reductions and complete problems for counting complexity classes
2000 · Arnaud Durand, Miki Hermann, et al. · Mathematical Foundations of Computer Science · 75
Subtractive Reductions and Complete Problems for Counting Complexity Classes
2000 · Arnaud Durand, Miki Hermann, et al. · Lecture notes in computer science · 57
PDF
Unification of infinite sets of terms schematized by primal grammars
1997 · Miki Hermann, Roman Galbavý · Theoretical Computer Science · 36
Characterization of Boolean functions for rapid matching in EPGA technology mapping
1992 · Ulf Schlichtmann, F. Brglez, et al. · 32
Counting complexity of propositional abduction
2009 · Miki Hermann, Reinhard Pichler · Journal of Computer and System Sciences · 29
PDF
Characterization of Boolean functions for rapid matching in EPGA technology mapping
2003 · U. Schlichtmann, F. Brglez, et al. · ACM/IEEE Design Automation Conference (DAC) · 28
On the Complexity of Computing Generators of Closed Sets
2008 · Miki Hermann, Barış Sertkaya · Springer eBooks · 18
The Inference Problem for Propositional Circumscription of Afine Formulas Is coNP-Complete
2003 · Arnaud Durand, Miki Hermann · Lecture notes in computer science · 18
On the Complexity of Counting the Hilbert Basis of a Linear Diophantine System
1999 · Miki Hermann, Laurent Juban, et al. · Lecture notes in computer science · 17
On P completeness of some counting problems
1993 · Nadia Creignou, Miki Hermann · 17
Implementations of Term Rewriting Systems
1991 · M. Hermann · The Computer Journal · 15
Complexity of Default Logic on Generalized Conjunctive Queries
2007 · Philippe Chapdelaine, Miki Hermann, et al. · Springer eBooks · 13
An Algebraic Approach to the Complexity of Generalized Conjunctive Queries
2005 · Michael Bauland, Philippe Chapdelaine, et al. · Lecture notes in computer science · 13
On the counting complexity of propositional circumscription
2007 · Arnaud Durand, Miki Hermann · Information Processing Letters · 12
Chain properties of rule closures
1990 · Miki Hermann · Formal Aspects of Computing · 12
PDF
Complexity of Counting the Optimal Solutions
2008 · Miki Hermann, Reinhard Pichler · Lecture notes in computer science · 11
PDF
Complexity of Clausal Constraints Over Chains
2007 · Nadia Creignou, Miki Hermann, et al. · Theory of Computing Systems · 11
On Boolean primitive positive clones
2007 · Miki Hermann · Discrete Mathematics · 11
PDF
On the relation between primitive recursion, schematization, and divergence
2005 · Miki Hermann · Springer eBooks · 11
The Complexity of Counting Problems in Equational Matching
1995 · Miki Hermann, Phokion G. Kolaitis · Journal of Symbolic Computation · 11
Meta-rule synthesis from crossed rewrite systems
1991 · Hélène Kirchner, Miki Hermann · Lecture notes in computer science · 11
Efficient Algorithms for Description Problems over Finite Totally Ordered Domains
2008 · Ángel J. Gil, Miki Hermann, et al. · SIAM Journal on Computing · 10
On the complexity of generalized chromatic polynomials
2017 · A. Goodall, M. Hermann, et al. · Advances in Applied Mathematics · 8
On the Computational Complexity of Monotone Constraint Satisfaction Problems
2009 · Miki Hermann, Florian Richoux · Lecture notes in computer science · 8
Works count: 100
Citation count: 788
H-index: 13
I10-index: 23
Year
Topic
Type