|
81 |
Theorie der Berechenbarkeit / Kurseinheit 7. Computational complexity
1988, [7. Aufl.]
|
|
|
|
82 |
Computational complexity of bilinear forms
Krishna, Hari. - Berlin : Springer, 1987
|
|
|
|
83 |
Computational complexity of terminological reasoning in BACK
Nebel, Bernhard. - Berlin : Inst. für Angewandte Informatik, Projektgruppe KIT, 1987
|
|
|
|
84 |
Dependence, convergence, and computational complexity of continuous functionals and operators on Cantor's space
Weihrauch, Klaus. - Hagen : Fernuniv., 1987
|
|
|
|
85 |
Lower bounds on computation time for various models in computational complexity theory
Dietzfelbinger, Martin. - Dortmund : Abt. Informatik, Univ., 1987
|
|
|
|
86 |
On the computational complexity of quantified Horn clauses
Karpiński, Marek. - Bonn : Inst. für Informatik, 1987
|
|
|
|
87 |
Uniform computational complexity of Taylor series
Müller, Norbert. - Hagen : Fernuniv., Gesamthochsch., 1987
|
|
|
|
88 |
Computational complexity
Wagner, Klaus W.. - Berlin : Deutscher Verlag d. Wiss., 1986
|
|
|
|
89 |
Computational complexity of real functions and real numbers
Müller, Norbert. - Hagen : Fern-Univ., LG Theoret. Informatik, 1986
|
|
|
|
90 |
On the computational complexity of the order polynomial
Faigle, Ulrich. - Bonn : Inst. für Ökonometrie u. Operations-Research, 1985
|
|
Administration
