|
University of Bonn -> Department of Computer Science -> Chair V | ||
CS-Reports 1999 |
Copyright 1999 University of Bonn,
Department of Computer Science, Chair V
|
|
85201 |
On the Computational Hardness of Testing Square-Freeness of Sparse Polynomials
Marek Karpinski, Igor Shparlinski [Download PostScript] [Download PDF] [Abstract] |
|
85202 |
An Exponential Lower Bound for Depth 3 Arithmetic Circuits
Dima Grigoriev, Marek Karpinski [Download PostScript] [Download PDF] [Abstract] |
|
85203 |
A Generalization of Wilkie's Theorem of the Complement and an Application to Pfaffian Closure
Marek Karpinski, Angus Macintyre [Download PostScript] [Download PDF] [Abstract] |
|
85204 |
Quantum Finite Multitape Automata
Andris Ambainis, Richard Bonner, Rusins Freivalds, Marats Golovkins, Marek Karpinski [Download PostScript] [Download PDF] [Abstract] |
|
85205 |
Randomized Complexity of Linear Arrangements and Polyhedra
Marek Karpinski [Download PostScript] [Download PDF] [Abstract] |
|
85206 |
Robust Real-Time Videotransmission over Lossy Channels
Christoph Günzel, Falko Riemenschneider [Download PostScript] [Download PDF] [Abstract] |
|
85207 |
Robust Real-Time Audiotransmission over Lossy Channels
Christoph Guenzel [Download PostScript] [Download PDF] [Abstract] |
|
85208 |
Byte-oriented Decoding of Canonical Huffman Codes
Yakov Nekritch [Download PostScript] [Download PDF] [Abstract] |
|
85209 |
Decoding of Canonical Huffman Codes with Look-Up Tables
Yakov Nekritch [Download PostScript] [Download PDF] [Abstract] |
|
85210 |
On-line Load Balancing for Related Machines
Piotr Berman, Moses Charikar, Marek Karpinski [Download PostScript] [Download PDF] [Abstract] |
|
85211 |
Polynomial Time Approximation Schemes for Dense Instances of the Minimum Constraint Satisfaction
Cristina Bazgan, Marek Karpinski [Download PostScript] [Download PDF] [Abstract] |
|
Last Change:
02/04/03 at 10:29:06
Deutsch |
University of Bonn -> Department of Computer Science -> Chair V |