Institut für Informatik
 
Abteilung V

 
Universität Bonn -> Institut für Informatik -> Abteilung V
CS-Reports 1993 Copyright 1993 Universität Bonn, Institut für Informatik, Abteilung V

8590 Bonn Workshop on Randomized Algorithms (RAND)
Dima Grigoriev, Marek Karpinski
[Download PostScript] [Download PDF] [Abstract]
8597 Polynomial-Time Computation of the Dimension of Algebraic Varieties in Zero--Characteristic
Aexander L. Christov
[Download PostScript] [Download PDF] [Abstract]
8598 An Algorithm to Learn Read-Once Threshold Formulas, and some Generic Transformations between Learning Models
Nader H. Bshouty, Thomas R. Hancock, Lisa Hellerstein, Marek Karpinski
[Download PostScript] [Download PDF] [Abstract]
8599 Lower Bounds on Complexity of Testing Membership to a Polygon for Algebraic and Randomized Computation Trees
Dima Grigoriev, Marek Karpinski
[Download PostScript] [Download PDF] [Abstract]
85100 ESPRIT BR Working Group - 7097 (RAND): Annual Progress Report 1992 , 1993
Marek Karpinski
[Download PostScript] [Download PDF] [Abstract]
85101 Alphabet-Independent Optimal Parallel Search for Three-Dimensional Patterns
Marek Karpinski, Wojciech Rytter
[Download PostScript] [Download PDF] [Abstract]
85102 On a Sublinear Time Parallel Construction of Optimal Binary Search Trees
Marek Karpinski, Wojciech Rytter
[Download PostScript] [Download PDF] [Abstract]
85103 Lower Bounds on Testing Membership to Polyhedron by Algebraic Decision Trees
Dima Grigoriev, Marek Karpinski, Nicolai Vorobjov
[Download PostScript] [Download PDF] [Abstract]
85104 Lower Space Bounds for Randomized Computation
Rusins Freivalds, Marek Karpinski
[Download PostScript] [Download PDF] [Abstract]
85105 An Interpolation Algorithm for Sparse Polynomials over Zm
Kai Werter
[Download PostScript] [Download PDF] [Abstract]
85106 Optimal Bounds for Testing Sparse Polynomials over F3
Kai Werter
[Download PostScript] [Download PDF] [Abstract]
Last Change: 06/18/13 at 09:36:56
 English
Universität Bonn -> Institut für Informatik -> Abteilung V