Miki Hermann And Notassociative-commutative matching
List of bibliographic references
Number of relevant bibliographic references: 10.| Ident. | Authors (with country if any) | Title |
|---|---|---|
| 000536 | Á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 |
| 000707 | Arnaud Durand [France] ; Miki Hermann [France] ; Phokion G. Kolaitis [États-Unis] | Subtractive Reductions and Complete Problems for Counting Complexity Classes |
| 000740 | Miki Hermann [France] ; Laurent Juban [France] ; Phokion G. Kolaitis [États-Unis] | On the complexity of counting the Hilbert basis of a linear Diophantine system |
| 000755 | Miki Hermann [France] ; Laurent Juban [France] ; Phokion G. Kolaitis [États-Unis] | On the Complexity of Counting the Hilbert Basis of a Linear Diophantine System |
| 000814 | Miki Hermann [France] ; Laurent Juban [France] ; Phokion G. Kolaitis [États-Unis] | On the Complexity of Counting the Hilbert Basis of a Linear Diophantine System |
| 000830 | Miki Hermann [France] ; Phokion G. Kolaitis [États-Unis] | On the complexity of unification and disunification in commutative idempotent semigroups |
| 000853 | Miki Hermann [France] ; Phokion G. Kolaitis [États-Unis] | Unification algorithms cannot be combined in polynomial time |
| 000889 | Miki Hermann [États-Unis] ; Phokion G. Kolaitis [États-Unis] | The Complexity of Counting Problems in Equational Matching |
| 000901 | Miki Hermann [France] ; Phokion G. Kolaitis [États-Unis] | Computational complexity of simultaneous elementary matching problems |
| 000911 | Miki Hermann [France] ; Phokion G. Kolaitis [États-Unis] | The complexity of counting problems in equational matching |
| This area was generated with Dilib version V0.6.33. |  |