|
1 |
Fast intepolation algorithms for sparse polynomials with respect to the size of coefficients
Chistov, Aleksandr L.. - Bonn : Inst. für Informatik, 1994
|
|
|
|
2 |
Final report / ESPRIT BR Working Group - 7097 (RAND)
Europäische Kommission. Europäisches Strategisches Programm für Forschung und Entwicklung auf dem Gebiet der Informationstechnologie. Working Group on Randomized Algorithms. - Bonn : Inst. für Informatik, 1994
|
|
|
|
3 |
Further improvements of Steiner tree approximations
Karpiński, Marek. - Saarbrücken : MPI Informatik, 1994
|
|
|
|
4 |
Improved approximation bounds for the rectilinear Steiner tree problem
Zelikovsky, Alexander. - Bonn : Inst. für Informatik, 1994
|
|
|
|
5 |
Improved lower bound on testing membership to a polyhedron by algebraic decision trees
Grigoriev, Dima. - Bonn : Inst. für Informatik, 1994
|
|
|
|
6 |
Lower bound for randomized linear decision trees recognising a union of hyperplanes ina gerneric position
Grigoriev, Dima. - Bonn : Inst. für Informatik, 1994
|
|
|
|
7 |
Lower bound on testing membership to a polyhedron by algebraic decision trees
Grigoriev, Dima. - Bonn : Inst. für Informatik, 1994
|
|
|
|
8 |
On the sequential and parallel complexity of matching in chordal and strongly chordal graphs
Dahlhaus, Elias. - Bonn : Inst. für Informatik, 1994
|
|
|
|
9 |
Pattern matching for strings with short descriptions
Karpiński, Marek. - Bonn : Inst. für Informatik, 1994
|
|
|
|
10 |
Polynomial bounds for VC dimension of sigmoidal neural networks
Karpiński, Marek. - Bonn : Inst. für Informatik, 1994
|
|
Administration
