Search - Archive ouverte HAL Access content directly

Filter your results

17 Results

Unification Algorithms Cannot Be Combined in Polynomial Time

Miki Hermann , Phokion G. Kolaitis
Information and Computation, 2000, 162 (1-2), pp.24-42
Journal articles inria-00099222v1

On the Complexity of Counting the Hilbert Basis of a Linear Diophantine System

Miki Hermann , Laurent Juban , Phokion G. Kolaitis
[Intern report] 98-R-281 || hermann98c, 1998, 16 p
Reports inria-00098565v1

The Next Whisky Bar

Mike Behrisch , Miki Hermann , Stefan Mengel , Gernot Salzer
11th International Computer Science Symposium in Russia (CSR'16), 2016, St. Petersburg, Russia. pp.41--56
Conference papers hal-03301002v1

Helly property and satisfiability of Boolean formulas defined on set systems,

Victor Chepoi , Nadia Creignou , Miki Hermann , Gernot Salzer
European Journal of Combinatorics, 2010, 31, pp.502-516
Journal articles hal-01199922v1

On the complexity of recognizing the Hilbert basis of a linear Diophantine system

Arnaud Durand , Miki Hermann , Laurent Juban
24th International Symposium on Mathematical Foundations of Computer Science - MFCS'99, 1999, Szklarska Poreba, Poland, pp.92-102
Conference papers inria-00098956v1
Image document

Complexity of Existential Positive First-Order Logic

Manuel Bodirsky , Miki Hermann , Florian Richoux
Journal of Logic and Computation, 2013, 23 (4), pp.753-760. ⟨10.1093/logcom/exr043⟩
Journal articles hal-00870985v1

On the Complexity of Recognizing the Hilbert Basis of a Linear Diophantine System

Arnaud Durand , Miki Hermann , Laurent Juban
Theoretical Computer Science, 2002, 270 (1-2), pp.625-642. ⟨10.1016/S0304-3975(01)00017-2⟩
Journal articles inria-00100710v1

As Close as It Gets

Mike Behrisch , Miki Hermann , Stefan Mengel , Gernot Salzer
10th International Workshop on Algorithms and Computation (WALCOM '16), 2016, Kathmandu, Nepal. pp.222--235
Conference papers hal-03300998v1
Image document

On P completeness of some counting problems

Nadia Creignou , Miki Hermann
[Research Report] RR-2144, INRIA. 1993
Reports inria-00074528v1

On the complexity of counting the Hilbert basis of a linear Diophantine system

Miki Hermann , Laurent Juban , Phokion G. Kolaitis
6th International Conference on Logic for Programming & Automated Reasoning - LPAR'99, Sep 1999, Tbilisi, Georgia, pp.13-32
Conference papers inria-00098753v1
Image document

On the Word, Subsumption, and Complement Problem for Recurrent Term Schematizations

Miki Hermann , Gernot Salzer
23nd International Conference on Mathematical Foundations of Computer Science, 1998, Brno, République Tchèque, pp.257-266
Conference papers inria-00098687v1

Computational Complexity of Simultaneous Elementary Matching Problems

Miki Hermann , Phokion G. Kolaitis
Journal of Automated Reasoning, 1999, 23 (2), pp.107-136
Journal articles inria-00098986v1

Minimal Distance of Propositional Models

Mike Behrisch , Miki Hermann , Stefan Mengel , Gernot Salzer
Theory of Computing Systems, 2019, 63 (6), pp.1131-1184. ⟨10.1007/s00224-018-9896-8⟩
Journal articles hal-02322184v1
Image document

How to Find the Exit from a 3-Dimensional Maze *

Miki Hermann
19th Symposium on Experimental Algorithms, Jun 2021, Nice, France. ⟨10.4230/LIPIcs.SEA.2021.21⟩
Conference papers hal-03329005v1
Image document

MCP: Capturing Big Data by Satisfiability (Tool Description)

Miki Hermann , Gernot Salzer
24th International Conference on Theory and Applications of Satisfiability Testing, 2021, Barcelona, Spain. pp.207 - 215, ⟨10.1007/978-3-030-80223-3_14⟩
Conference papers hal-03329013v1
Image document

Dichotomy theorem for the generalized unique satisfiability problem

Miki Hermann , Laurent Juban
[Intern report] 98-R-065 || hermann98b, 1998, 11 p
Reports inria-00098730v1

Subtractive Reductions and Complete Problems for Counting Complexity Classes

Arnaud Durand , Miki Hermann , Phokion G. Kolaitis
25th International Symposium on Mathematical Foundations of Computer Science - MFCS'2000, 2000, Bratislava, Slovaquie, pp.323-332
Conference papers inria-00099381v1