00A333 (1999-09) |
Miki Hermann [France] ; Laurent Juban [France] ; Phokion G. Kolaitis [États-Unis] | On the complexity of counting the Hilbert basis of a linear Diophantine system |
00A568 (1999) |
Miki Hermann ; Laurent Juban ; Phokion G. Kolaitis | On the complexity of counting the Hilbert basis of a linear Diophantine system |
00A959 (1999) |
Miki Hermann [France] ; Laurent Juban [France] ; Phokion G. Kolaitis [États-Unis] | On the Complexity of Counting the Hilbert Basis of a Linear Diophantine System |
00AF85 (1998) |
Miki Hermann ; Laurent Juban ; Phokion G. Kolaitis | On the Complexity of Counting the Hilbert Basis of a Linear Diophantine System |
00B613 (1998) |
Miki Hermann [France] ; Laurent Juban [France] ; Phokion G. Kolaitis [États-Unis] | On the Complexity of Counting the Hilbert Basis of a Linear Diophantine System |
008241 (2002) |
Arnaud Durand [Canada] ; Miki Hermann [France] ; Laurent Juban [France] | On the Complexity of Recognizing the Hilbert Basis of a Linear Diophantine System |
008336 (2002) |
Arnaud Durand ; Miki Hermann ; Laurent Juban | On the Complexity of Recognizing the Hilbert Basis of a Linear Diophantine System |
009965 (2000) |
Miki Hermann ; Phokion G. Kolaitis | Unification Algorithms Cannot Be Combined in Polynomial Time |
009B78 (2000) |
Arnaud Durand ; Miki Hermann ; Phokion G. Kolaitis | Subtractive Reductions and Complete Problems for Counting Complexity Classes |
009E04 (2000) |
Miki Hermann [France] ; Phokion G. Kolaitis | Unification Algorithms Cannot Be Combined in Polynomial Time |
009E24 (2000) |
Arnaud Durand [France] ; Miki Hermann [France] ; Phokion G. Kolaitis [États-Unis] | Subtractive Reductions and Complete Problems for Counting Complexity Classes |
00A135 (2000) |
Arnaud Durand [France] ; Miki Hermann [France] ; Phokion G. Kolaitis [Canada] | Subtractive Reductions and Complete Problems for Counting Complexity Classes |
00A561 (1999) |
Arnaud Durand ; Miki Hermann ; Laurent Juban | On the complexity of recognizing the Hilbert basis of a linear Diophantine system |
00A577 (1999) |
Miki Hermann ; Phokion G. Kolaitis | Computational Complexity of Simultaneous Elementary Matching Problems |
00A958 (1999) |
Arnaud Durand [France] ; Miki Hermann [France] ; Laurent Juban [France] | On the Complexity of Recognizing the Hilbert Basis of a Linear Diophantine System |
00AA28 (1999) |
Miki Hermann [France] ; Phokion G. Kolaitis [États-Unis] | Computational Complexity of Simultaneous Elementary Matching Problems |
00AC68 (1999) |
Arnaud Durand [France] ; Miki Hermann [France] ; Laurent Juban [France] | On the complexity of recognizing the Hilbert basis of a linear Diophantine system |
00B078 (1998) |
Miki Hermann ; Laurent Juban | Dichotomy theorem for the generalized unique satisfiability problem |
00B663 (1998) |
Miki Hermann [France] ; Laurent Juban | Dichotomy theorem for the generalized unique satisfiability problem |
00B883 (1997) |
Miki Hermann ; Phokion G. Kolaitis | On the complexity of unification and disunification in commutative idempotent semigroups |
00BC30 (1997) |
Miki Hermann [France] ; Phokion G. Kolaitis [États-Unis] | On the complexity of unification and disunification in commutative idempotent semigroups |
00C004 (1996) |
Miki Hermann [France] ; Phokion G. Kolaitis [États-Unis] | Unification algorithms cannot be combined in polynomial time |
00C695 (1995) |
Miki Hermann [États-Unis] ; Phokion G. Kolaitis [États-Unis] | The Complexity of Counting Problems in Equational Matching |
00C774 (1995) |
Miki Hermann [France] ; Phokion G. Kolaitis [États-Unis] | Computational complexity of simultaneous elementary matching problems |
00CC77 (1994) |
Miki Hermann [France] ; Phokion G. Kolaitis [États-Unis] | The complexity of counting problems in equational matching |
006C07 (2004) |
Ángel J. Gil [Espagne, États-Unis] ; Miki Hermann [France] ; Gernot Salzer [Autriche] ; Bruno Zanuttini [France] | Efficient Algorithms for Constraint Description Problems over Finite Totally Ordered Domains |
009B87 (2000) |
Cristina Bazgan ; Laurent Juban | On the complexity of recognizing decomposable perfect graphs |
00A175 (2000) |
Cristina Bazgan [France] ; Laurent Juban [France] | On the complexity of recognizing decomposable perfect graphs |
00A435 (1999) |
Laurent Juban | Sur les Problèmes de Complexité en Déduction Automatique :Base de Hilbert, Modèles Uniques et Minimaux |
00A666 (1999) |
Laurent Juban | Dichotomy Theorem for the Generalized Unique Satisfiability Problem |
00AA10 (1999) |
Laurent Juban [France] | Dichotomy theorem for the generalized unique satisfiability problem |
00AD25 (1999) |
Laurent Juban [France] | Dichotomy Theorem for the Generalized Unique Satisfiability Problem |
00AE37 (1998) |
Laurent Juban | Comptage de l'ensemble des éléments de la base de Hilbert d'un système d'équations diophantiennes linéaires |
00B123 (1998) |
Miki Hermann ; Gernot Salzer | On the Word, Subsumption, and Complement Problem for Recurrent Term Schematizations |
00B336 (1998) |
Miki Hermann [France] ; Gernot Salzer [Autriche] | On the word, subsumption, and complement problem for recurrent term schematizations |
00B528 (1998) |
Laurent Juban [France] | Comptage de l'ensemble des éléments de la base de Hilbert d'un système d'équations diophantiennes linéaires |
00B611 (1998) |
Miki Hermann [France] ; Gernot Salzer | On the Word, Subsumption, and Complement Problem for Recurrent Term Schematizations |
00B963 (1997) |
Miki Hermann ; Roman Galbavy | Unification of infinite sets of terms schematized by primal grammars |
00BB05 (1997) |
Ali Amaniss ; Miki Hermann ; Denis Lugiez | Set Operations for Recurrent Term Schematizations |
00BB18 (1997) |
Miki Hermann [France] ; Roman Galbav [France] | Unification of infinite sets of terms schematized by primal grammars |
00BC15 (1997) |
Ali Amaniss [France] ; Miki Hermann [France] ; Denis Lugiez [France] | Set operations for recurrent term schematizations |
00C079 (1996) |
Nadia Creignou [France] ; Miki Hermann [France] | Complexity of Generalized Satisfiability Counting Problems |
00D653 (1992) |
Miki Hermann [France] | On the relation between primitive recursion, schematization, and divergence |
00DA55 (1991) |
Miki Hermann [France] | On proving properties of completion strategies |
00DA59 (1991) |
Hélène Kirchner [France] ; Miki Hermann [France] | Meta-rule synthesis from crossed rewrite systems |
00DE49 (1990) |
Miki Hermann [France] | Chain properties of rule closures |
00E067 (1989) |
Miki Hermann [France] | Chain properties of rule closures |