Documents par ordre de pertinence

000967 (2000)	A. Durand [France] ; M. Hermann [France] ; P. G. Kolaitis [États-Unis]	Subtractive reductions and complete problems for counting complexity classes
000A70 (1999)	A. Durand [France] ; M. Hermann [France] ; L. Juban [France]	On the complexity of recognizing the Hilbert basis of a linear Diophantine system
000A71 (1999)	M. Hermann [France] ; L. Juban [France] ; P. G. Kolaitis [États-Unis]	On the complexity of counting the Hilbert basis of a linear Diophantine system
000C19 (1997)	M. Hermann [France] ; P. G. Kolaitis [États-Unis]	On the complexity of unification and disunification in commutative idempotent semigroups
000C74 (1996)	M. Hermann [France] ; P. G. Kolaitis [États-Unis]	Unification algorithms cannot be combined in polynomial time
000A90 (1999)	L. Juban [France]	Dichotomy theorem for the generalized unique satisfiability problem
000B38 (1998)	M. Hermann [France] ; G. Salzer [Autriche]	On the word, subsumption, and complement problem for recurrent term schematizations
000C01 (1997)	M. Hermann [France] ; R. Galbavy [France]	Unification of infinite sets of terms schematized by primal grammars
000C09 (1997)	A. Amaniss [France] ; M. Hermann ; D. Lugiez	Set operations for recurrent term schematizations
000C97 (1996)	N. Creignou [France] ; M. Hermann [France]	Complexity of generalized satisfiability counting problems
000D65 (1991)	M. Hermann ; C. Kirchner ; H. Kirchner	Implementations of term rewriting systems

This area was generated with Dilib version V0.6.33.
Data generation: Mon Jun 10 21:56:28 2019. Site generation: Fri Feb 25 15:29:27 2022

	Serveur d'exploration sur la recherche en informatique en Lorraine
	Attention, ce site est en cours de développement ! Attention, site généré par des moyens informatiques à partir de corpus bruts. Les informations ne sont donc pas validées.