|
101 |
An exponential lower bound for depth 3 arithmetic circuits
Grigoriev, Dima. - Bonn : Inst. für Informatik, 1999
|
|
|
|
102 |
On-line load balancing for related machines
Berman, Piotr. - Bonn : Inst. für Informatik, 1999
|
|
|
|
103 |
On the computational hardness of testing square freeness of sparse polynomials
Karpiński, Marek. - Bonn : Inst. für Informatik, 1999
|
|
|
|
104 |
Polynomial time approximation schemes for dense instances of the minimum constraint satisfaction
Bazgan, Cristina. - Bonn : Inst. für Informatik, 1999, Preliminary version
|
|
|
|
105 |
Randomized complexity of linear arrangements and polyhedra
Karpiński, Marek. - Bonn : Inst. für Informatik, 1999
|
|
|
|
106 |
A lower bound for integer multiplication on randomized read once branching programs
Ablaev, Farid. - Bonn : Inst. für Informatik, 1998
|
|
|
|
107 |
A note on Las Vegas OBDDs
Karpiński, Marek. - Bonn : Inst. für Informatik, 1998
|
|
|
|
108 |
Approximation of the permanent for graphs of density less than 1/2 is hard
Dahlhaus, Elias. - Bonn : Inst. für Informatik, 1998
|
|
|
|
109 |
NP-hardness of the bandwidth problem on dense graphs
Karpiński, Marek. - Bonn : Inst. für Informatik, 1998
|
|
|
|
110 |
On approximation hardness of dense TSP and other path problems
Fernandez de la Vega, Wenceslas. - Bonn : Inst. für Informatik, 1998
|
|
Administration
