|
71 |
Computational complexity of sparse rational interpolation Grigoriev, Dima. - Bonn : Inst. für Informatik, 1991
|
|
|
72 |
On the computational complexity of some algebraic counting problems Lhotzky, Barbara, 1991
|
|
|
73 |
On the computational complexity of temporal projection and some related problems Nebel, Bernhard. - Kaiserslautern : DFKI, 1991
|
|
|
74 |
The computational complexity of knot and matroid polynomials Welsh, Dominic J. A.. - Bonn : Sonderforschungsbereich 303, 1991
|
|
|
75 |
Minkowski addition of polytopes: computational complexity and applications to Gröbner bases Gritzmann, Peter. - Augsburg : Inst. für Mathematik, 1990
|
|
|
76 |
On the computational complexity of Seidel's switching Kratochvíl, Jan. - Bonn : Inst. für Ökonometrie und Operations-Research, 1990
|
|
|
77 |
On the computational complexity of Seidel's switching Kratochvíl, Jan. - Bonn : Sonderforschungsbereich 303, 1990
|
|
|
78 |
The computational complexity of (XOR, AND) counting problems Ehrenfeucht, Andrzej. - Bonn : Inst. für Informatik, 1990
|
|
|
79 |
The computational complexity of graph problems with succinct multigraph representation Karpiński, Marek. - Augsburg : Inst. für Mathematik, 1988
|
|
|
80 |
The computational complexity of graph problems with succinct multigraph representation Karpiński, Marek. - Bonn : Inst. für Informatik, 1988
|
|