Miki Hermann

Publication Activity (10 Years)

Years Active: 1986-2021
Publications (10 Years): 9

Top Topics

Complexity Analysis

Top Venues

Theory Comput. Syst.

Publications

Miki Hermann
How to Find the Exit from a 3-Dimensional Maze. SEA (2021)
Miki Hermann, Gernot Salzer
MCP: Capturing Big Data by Satisfiability (Tool Description). SAT (2021)
Mike Behrisch, Miki Hermann, Stefan Mengel, Gernot Salzer
Minimal Distance of Propositional Models. Theory Comput. Syst. 63 (6) (2019)
Andrew J. Goodall, Miki Hermann, Tomer Kotek, Johann A. Makowsky, Steven D. Noble
On the complexity of generalized chromatic polynomials. Adv. Appl. Math. 94 (2018)
Andrew J. Goodall, Miki Hermann, Tomer Kotek, Johann A. Makowsky, Steven D. Noble
On the complexity of generalized chromatic polynomials. CoRR (2017)
Mike Behrisch, Miki Hermann, Stefan Mengel, Gernot Salzer
The Next Whisky Bar. CSR (2016)
Mike Behrisch, Miki Hermann, Stefan Mengel, Gernot Salzer
As Close as It Gets. WALCOM (2016)
Mike Behrisch, Miki Hermann, Stefan Mengel, Gernot Salzer
Give Me Another One! ISAAC (2015)
Mike Behrisch, Miki Hermann, Stefan Mengel, Gernot Salzer
Minimal Distance of Propositional Models. CoRR (2015)
Manuel Bodirsky, Miki Hermann, Florian Richoux
Complexity of existential positive first-order logic. J. Log. Comput. 23 (4) (2013)
Pavol Hell, Miki Hermann, Mayssam Mohammadi Nevisi
Counting Partitions of Graphs. ISAAC (2012)
Arnaud Durand, Miki Hermann, Gustav Nordh
Trichotomies in the Complexity of Minimal Inference. Theory Comput. Syst. 50 (3) (2012)
Manuel Bodirsky, Miki Hermann, Florian Richoux
Complexity of Existential Positive First-Order Logic CoRR (2010)
Miki Hermann, Reinhard Pichler
Counting complexity of propositional abduction. J. Comput. Syst. Sci. 76 (7) (2010)
Victor Chepoi, Nadia Creignou, Miki Hermann, Gernot Salzer
The Helly property and satisfiability of Boolean formulas defined on set families. Eur. J. Comb. 31 (2) (2010)
Arnaud Durand, Miki Hermann, Gustav Nordh
Trichotomy in the Complexity of Minimal Inference. LICS (2009)
Manuel Bodirsky, Miki Hermann, Florian Richoux
Complexity of Existential Positive First-Order Logic. CiE (2009)
Miki Hermann, Reinhard Pichler
Complexity of counting the optimal solutions. Theor. Comput. Sci. 410 (38-40) (2009)
Miki Hermann, Florian Richoux
On the Computational Complexity of Monotone Constraint Satisfaction Problems. WALCOM (2009)
Miki Hermann, Reinhard Pichler
Complexity of Counting the Optimal Solutions. Electron. Colloquium Comput. Complex. 15 (044) (2008)
Victor Chepoi, Nadia Creignou, Miki Hermann, Gernot Salzer
Deciding the Satisfiability of Propositional Formulas in Finitely-Valued Signed Logics. ISMVL (2008)
Nadia Creignou, Miki Hermann, Andrei A. Krokhin, Gernot Salzer
Complexity of Clausal Constraints Over Chains. Theory Comput. Syst. 42 (2) (2008)
Miki Hermann, Reinhard Pichler
Counting Complexity of Minimal Cardinality and Minimal Weight Abduction. JELIA (2008)
Miki Hermann, Baris Sertkaya
On the Complexity of Computing Generators of Closed Sets. ICFCA (2008)
Arnaud Durand, Miki Hermann
On the counting complexity of propositional circumscription. Inf. Process. Lett. 106 (4) (2008)
Àngel J. Gil, Miki Hermann, Gernot Salzer, Bruno Zanuttini
Efficient Algorithms for Description Problems over Finite Totally Ordered Domains. SIAM J. Comput. 38 (3) (2008)
Miki Hermann
On Boolean primitive positive clones. Discret. Math. 308 (15) (2008)
Miki Hermann, Reinhard Pichler
Complexity of Counting the Optimal Solutions. COCOON (2008)
Miki Hermann, Reinhard Pichler
Counting Complexity of Propositional Abduction. IJCAI (2007)
Philippe Chapdelaine, Miki Hermann, Ilka Schnoor
Complexity of Default Logic on Generalized Conjunctive Queries. LPNMR (2007)
Arnaud Durand, Miki Hermann, Phokion G. Kolaitis
Subtractive reductions and complete problems for counting complexity classes. Theor. Comput. Sci. 340 (3) (2005)
Àngel J. Gil, Miki Hermann, Gernot Salzer, Bruno Zanuttini
Efficient Algorithms for Constraint Description Problems over Finite Totally Ordered Domains: Extended Abstract. IJCAR (2004)
Michael Bauland, Philippe Chapdelaine, Nadia Creignou, Miki Hermann, Heribert Vollmer
An Algebraic Approach to the Complexity of Generalized Conjunctive Queries. SAT (2004)
Michael Bauland, Philippe Chapdelaine, Nadia Creignou, Miki Hermann, Heribert Vollmer
An Algebraic Approach to the Complexity of Generalized Conjunctive Queries. SAT (Selected Papers (2004)
Georg Gottlob, Miki Hermann, Michaël Rusinowitch
2nd International Workshop on Complexity in Automated Deduction (CiAD) - Foreword. Theory Comput. Syst. 37 (6) (2004)
Arnaud Durand, Miki Hermann
The Inference Problem for Propositional Circumscription of Affine Formulas Is coNP-Complete. STACS (2003)
Arnaud Durand, Miki Hermann, Laurent Juban
On the complexity of recognizing the Hilbert basis of a linear diophantine system. Theor. Comput. Sci. 270 (1-2) (2002)
Miki Hermann, Phokion G. Kolaitis
Unification Algorithms Cannot Be Combined in Polynomial Time. Inf. Comput. 162 (1-2) (2000)
Arnaud Durand, Miki Hermann, Phokion G. Kolaitis
Subtractive Reductions and Complete Problems for Counting Complexity Classes. MFCS (2000)
Arnaud Durand, Miki Hermann, Laurent Juban
On the Complexity of Recognizing the Hilbert Basis of a Linear Diophantine System. MFCS (1999)
Miki Hermann, Laurent Juban, Phokion G. Kolaitis
On the Complexity of Counting the Hilbert Basis of a Linear Diophnatine System. LPAR (1999)
Miki Hermann, Phokion G. Kolaitis
Computational Complexity of Simultaneous Elementary Matching Problems. J. Autom. Reason. 23 (2) (1999)
Miki Hermann, Gernot Salzer
On the Word, Subsumption, and Complement Problem for Recurrent Term Schematizations. MFCS (1998)
Miki Hermann, Phokion G. Kolaitis
On the Complexity of Unification and Disunification in Commutative Idempotent Semigroups. CP (1997)
Miki Hermann, Roman Galbavý
Unification of Infinite Sets of Terms Schematized by Primal Grammars. Theor. Comput. Sci. 176 (1-2) (1997)
Ali Amaniss, Miki Hermann, Denis Lugiez
Set Operations for Recurrent Term Schematizations. TAPSOFT (1997)
Nadia Creignou, Miki Hermann
Complexity of Generalized Satisfiability Counting Problems. Inf. Comput. 125 (1) (1996)
Miki Hermann, Phokion G. Kolaitis
Unification Algorithms Cannot be Combined in Polynomial Time. CADE (1996)
Miki Hermann, Phokion G. Kolaitis
The Complexity of Counting Problems in Equational Matching. J. Symb. Comput. 20 (3) (1995)
Miki Hermann, Phokion G. Kolaitis
Computational Complexity of Simultaneous Elementary Matching Problems (Extended Abstract). MFCS (1995)
Miki Hermann, Phokion G. Kolaitis
The Complexity of Counting Problems in Equational Matching. CADE (1994)
Miki Hermann
On the Relation Between Primitive Recursion, Schematization and Divergence. ALP (1992)
Miki Hermann
On Proving Properties of Completion Strategies. RTA (1991)
Miki Hermann, Claude Kirchner, Hélène Kirchner
Implementations of Term Rewriting Systems. Comput. J. 34 (1) (1991)
Hélène Kirchner, Miki Hermann
Meta-rule Synthesis from Crossed Rewrite Systems. CTRS (1990)
Miki Hermann
Chain Properties of Rule Closures. Formal Aspects Comput. 2 (3) (1990)
Miki Hermann
Chain Properties of Rule Closures. STACS (1989)
Miki Hermann, Igor Prívara
On Nontermination of Knuth-Bendix Algorithm. ICALP (1986)