 |
 |
 |
 |
|
|
||
|---|---|---|
|
inria-00074528v1
Rapport
Nadia Creignou, Miki Hermann. On P completeness of some counting problems [Research Report] RR-2144, INRIA. 1993 |
||
|
inria-00098753v1
Communication dans un congrès
Miki Hermann, Laurent Juban, Phokion G. Kolaitis. On the complexity of counting the Hilbert basis of a linear Diophantine system H. Ganzinger, D. McAllister, & A. Voronkov. 6th International Conference on Logic for Programming & Automated Reasoning - LPAR'99, Sep 1999, Tbilisi, Georgia, Springer-Verlag, 1705, pp.13-32, 1999, Lecture Notes in Computer Science (in Artificial Intelligence) |
||
|
inria-00098986v1
Article dans une revue
Miki Hermann, Phokion G. Kolaitis. Computational Complexity of Simultaneous Elementary Matching Problems Journal of Automated Reasoning, Springer Verlag, 1999, 23 (2), pp.107-136 |
||
|
inria-00099381v1
Communication dans un congrès
Arnaud Durand, Miki Hermann, Phokion G. Kolaitis. Subtractive Reductions and Complete Problems for Counting Complexity Classes M. Nielsen et B. Rovan. 25th International Symposium on Mathematical Foundations of Computer Science - MFCS'2000, 2000, Bratislava, Slovaquie, Springer-Verlag, 1893, pp.323-332, 2000, Lecture Notes in Computer Science |
||
|
inria-00098687v1
Communication dans un congrès
Miki Hermann, Gernot Salzer. On the Word, Subsumption, and Complement Problem for Recurrent Term Schematizations L. Brim and J. Gruska and J. Zlatuska. 23nd International Conference on Mathematical Foundations of Computer Science, 1998, Brno, République Tchèque, Springer, 1450, pp.257-266, 1998, Lecture Notes in Computer Science |
||
|
inria-00098730v1
Rapport
Miki Hermann, Laurent Juban. Dichotomy theorem for the generalized unique satisfiability problem [Intern report] 98-R-065 || hermann98b, 1998, 11 p |
||
|
inria-00098956v1
Communication dans un congrès
Arnaud Durand, Miki Hermann, Laurent Juban. On the complexity of recognizing the Hilbert basis of a linear Diophantine system M. Kutylowski, L. Pacholski, T. Wierzbicki. 24th International Symposium on Mathematical Foundations of Computer Science - MFCS'99, 1999, Szklarska Poreba, Poland, Springer-Verlag, 1672, pp.92-102, 1999, Lecture Notes in Computer Science |
||
|
inria-00098565v1
Rapport
Miki Hermann, Laurent Juban, Phokion G. Kolaitis. On the Complexity of Counting the Hilbert Basis of a Linear Diophantine System [Intern report] 98-R-281 || hermann98c, 1998, 16 p |
||
|
inria-00099222v1
Article dans une revue
Miki Hermann, Phokion G. Kolaitis. Unification Algorithms Cannot Be Combined in Polynomial Time Information and Computation, Elsevier, 2000, 162 (1-2), pp.24-42 |
||
|
inria-00100710v1
Article dans une revue
Arnaud Durand, Miki Hermann, Laurent Juban. On the Complexity of Recognizing the Hilbert Basis of a Linear Diophantine System Theoretical Computer Science, Elsevier, 2002, 270 (1-2), pp.625-642 |
||
|
|
||