Department of Computer Science
 
Chair V

 
University of Bonn -> Department of Computer Science -> Chair V
CS-Reports 1992 Copyright 1992 University of Bonn, Department of Computer Science, Chair V

8576 Computational Complexity of Sparse Real Algebraic Function Interpolation
Dima Grigoriev, Marek Karpinski and Michael F. Singer
[Download PostScript] [Download PDF] [Abstract]
8579 A Zero-Test and an Interpolation Algorithm for the Shifted Sparse Polynomials
Dima Grigoriev, Marek Karpinski
[Download PostScript] [Download PDF] [Abstract]
8580 On randomized algebraic test complexity
Peter Buergisser, Marek Karpinski, Thomas Lickteig
[Download PostScript] [Download PDF] [Abstract]
8581 On Randomized Versus Deterministic Computation
Marek Karpinski, Rutger Verbeek
[Download PostScript] [Download PDF] [Abstract]
8582 Computation of the Additive Complexity of Algebraic Circuits with Root Extracting
Dima Grigoriev, Marek Karpinski
[Download PostScript] [Download PDF] [Abstract]
8583 Simulating Threshold Circuits by Majority Circuits
Mikael Goldmann, Marek Karpinski
[Download PostScript] [Download PDF] [Abstract]
Last Change: 09/06/04 at 07:36:19
 Deutsch
University of Bonn -> Department of Computer Science -> Chair V