|
|
| |
| University of Bonn -> Department of Computer Science -> Chair V | ||
| CS-Reports 1991 |
Copyright 1991 University of Bonn,
Department of Computer Science, Chair V
|
|
| 8561 |
Some Computational Problems in Linear Algebra as Hard as Matrix Multiplication
Peter Buergnisser, Marek Karpinski, Thomas Lickteig [Download PostScript] [Download PDF] [Abstract] |
|
| 8562 |
Nondivisibility of Sparse Polynomials is in NP Under the Extended Riemann Hypothesis
Dima Grigoriev, Marek Karpinski, Andrew M. Odlyzko [Download PostScript] [Download PDF] [Abstract] |
|
| 8564 |
An (\epsilon, \delta)-Approximation Algorithm of the Number of Zeros of a Multilinear Polynomial over GF[q]
Marek Karpinski, Barbara Lhotzky [Download PostScript] [Download PDF] [Abstract] |
|
| 8565 |
An Approximation Algorithm for the Number of Zeros of Arbitrary Polynomials over GF[q]
Dima Grigoriev, Marek Karpinski [Download PostScript] [Download PDF] [Abstract] |
|
| 8566 |
Computational Complexity of Sparse Rational Interpolation
Dima Grigoriev, Marek Karpinski, Michael F. Singer [Download PostScript] [Download PDF] [Abstract] |
|
| 8569 |
Lower Bounds for the Number of Zeros of Multivariate Polynomials over GF [q]
Dima Grigoriev, Marek Karpinski [Download PostScript] [Download PDF] [Abstract] |
|
| 8570 |
An Efficient Parallel Algorithm for Computing a Maximal Independent Set in a Hypergraph of Dimension 3
Elias Dahlhaus, Marek Karpinski, Pierre Kelsen [Download PostScript] [Download PDF] [Abstract] |
|
| 8572 |
Probabilistic Recurrence Relations for Parallel Divide-and-Conquer Algorithms
Marek Karpinski, Wolf Zimmermann [Download PostScript] [Download PDF] [Abstract] |
|
| 8574 |
Read-Once Threshold Formulas, Justifying Assignments, and Generic Transformations
Nader H. Bshouty, Thomas R. Hancock, Lisa Hellerstein, Marek Karpinski [Download PostScript] [Download PDF] [Abstract] |
|
|
Last Change:
02/04/03 at 10:34:42
|
University of Bonn -> Department of Computer Science -> Chair V | |