|
|
|
|
|
|
|
|
|
inria-00099381v1
Communication dans un congrès
Arnaud Durand, Miki Hermann, Phokion G. Kolaitis. Subtractive Reductions and Complete Problems for Counting Complexity ClassesM. 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-00098956v1
Communication dans un congrès
Arnaud Durand, Miki Hermann, Laurent Juban. On the complexity of recognizing the Hilbert basis of a linear Diophantine systemM. 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
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|