|
|
| |
| Universität Bonn -> Institut für Informatik -> Abteilung V | ||
| CS-Reports 2007 |
Copyright 2007 Universität Bonn,
Institut für Informatik, Abteilung V
|
|
| 85280 |
Trading Tensors for Cloning: Constant Time Approximation Schemes for Metric MAX-CSP (Revised Version)
W. Fernandez de la Vega and Marek Karpinski [Download PostScript] [Download PDF] [Abstract] |
|
| 85281 |
A Fast Algorithm for Adaptive Prefix Coding
Marek Karpinski and Yakov Nekrich [Download PostScript] [Download PDF] [Abstract] |
|
| 85282 |
Predecessor Queries in Constant Time? (Revised Version)
Marek Karpinski and Yakov Nekrich [Download PostScript] [Download PDF] [Abstract] |
|
| 85283 |
Approximation Hardness of the (1,2)-Steiner Tree Problem
Mathias Hauptmann [Download PostScript] [Download PDF] [Abstract] |
|
| 85284 |
Approximating Transitive Reductions for Directed Networks
Piotr Berman, Bhaskar DasGupta and Marek Karpinski [Download PostScript] [Download PDF] [Abstract] |
|
| 85285 |
Complexity of Computing Functions by Quantum Branching Programs
Farid Ablayev, Marek Karpinski and Airat Khasianov [Download PostScript] [Download PDF] [Abstract] |
|
|
Last Change:
12/05/07 at 13:02:44
|
Universität Bonn -> Institut für Informatik -> Abteilung V | |