Rheinische Friedrich-Wilhelms-Universität Bonn Institut für Informatik
 
Abteilung V

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

8543 The Computational Complexity of ({\it XOR, AND\, })-Counting Problems
Andrzej Ehrenfeucht, Marek Karpinski
[Download PostScript] [Download PDF] [Abstract]
8544 Approximating the Number of Solutions of a G F [ 2 ] Polynomial
Marek Karpinski, Michael Luby
[Download PostScript] [Download PDF] [Abstract]
8545 On the Complexity of Genuinely Polynomial Computation
Marek Karpinski, Friedhelm Meyer auf der Heide
[Download PostScript] [Download PDF] [Abstract]
8547 Some lower and upper complexity bounds for generalized Fourier transforms
Ulrich Baum, Michael Clausen
[Download PostScript] [Download PDF] [Abstract]
8549 Nearly Optimal Parallel Algorithm for Maximum Matching in Planar Graphs
Ming Kao, Marek Karpinski, Andrzej Lingas
[Download PostScript] [Download PDF] [Abstract]
8550 Improved Upper Complexity Bounds for the Discrete Fourier Transform
Ulrich Baum, Michael Clausen, Benno Tietz
[Download PostScript] [Download PDF] [Abstract]
8551 Some Lower and Upper Complexity Bounds for Generalized Fourier Transforms and their Inverses
Ulrich Baum, Michael Clausen
[Download PostScript] [Download PDF] [Abstract]
8552 Learning Unrestricted Read-Once Formulas in Polynomial Time
Dana Angluin, Lisa Hellerstein and Marek Karpinski
[Download PostScript] [Download PDF] [Abstract]
8553 Optimal Algorithms for Multiplication in certain Finite Fields using Ellipctic Curves
Mohammad Amin Shokrollahi
[Download PostScript] [Download PDF] [Abstract]
8554 On the Weight Distribution of Elliptic Codes
Mohammad Amin Shokrollahi
[Download PostScript] [Download PDF] [Abstract]
8555 A Resolution Method for Quantified Boolean Formulas
Marek Karpinski, Hans Kleine-Buening
[Download PostScript] [Download PDF] [Abstract]
8556 Computational Complexity of Learning Read-Once Formulas over Different Bases
Lisa Hellerstein, Marek Karpinski
[Download PostScript] [Download PDF] [Abstract]
8559 Subclasses of Quantified Boolean Formulas
Andreas Floegel, Marek Karpinski, Hans Kleine-Buening
[Download PostScript] [Download PDF] [Abstract]
8560 Algorithms for Sparse Rational Interpolation
Dima Grigoriev, Marek Karpinski
[Download PostScript] [Download PDF] [Abstract]
Last Change: 01/08/09 at 14:24:47
 English
Universität Bonn -> Institut für Informatik -> Abteilung V

Powered by Zope