M. Hermann And NotArticle synthèse
List of bibliographic references
Number of relevant bibliographic references: 9.| Ident. | Authors (with country if any) | Title |
|---|---|---|
| 000967 | A. Durand [France] ; M. Hermann [France] ; P. G. Kolaitis [États-Unis] | Subtractive reductions and complete problems for counting complexity classes |
| 000A70 | A. Durand [France] ; M. Hermann [France] ; L. Juban [France] | On the complexity of recognizing the Hilbert basis of a linear Diophantine system |
| 000A71 | M. Hermann [France] ; L. Juban [France] ; P. G. Kolaitis [États-Unis] | On the complexity of counting the Hilbert basis of a linear Diophantine system |
| 000B38 | M. Hermann [France] ; G. Salzer [Autriche] | On the word, subsumption, and complement problem for recurrent term schematizations |
| 000C01 | M. Hermann [France] ; R. Galbavy [France] | Unification of infinite sets of terms schematized by primal grammars |
| 000C09 | A. Amaniss [France] ; M. Hermann ; D. Lugiez | Set operations for recurrent term schematizations |
| 000C19 | M. Hermann [France] ; P. G. Kolaitis [États-Unis] | On the complexity of unification and disunification in commutative idempotent semigroups |
| 000C74 | M. Hermann [France] ; P. G. Kolaitis [États-Unis] | Unification algorithms cannot be combined in polynomial time |
| 000C97 | N. Creignou [France] ; M. Hermann [France] | Complexity of generalized satisfiability counting problems |
| This area was generated with Dilib version V0.6.33. |  |