Sciweavers

1399 search results - page 37 / 280
» Multi-party Finite Computations
Sort
View
AAECC
2006
Springer
135views Algorithms» more  AAECC 2006»
13 years 10 months ago
Computing Hypergeometric Solutions of Linear Recurrence Equations
We describe a complete algorithm to compute the hypergeometric solutions of linear recurrence relations with rational function coefficients. We use the notion of finite singularit...
Thomas Cluzeau, Mark van Hoeij
JCC
2008
91views more  JCC 2008»
13 years 10 months ago
An improved pairwise decomposable finite-difference Poisson-Boltzmann method for computational protein design
Abstract: Our goal is to develop accurate electrostatic models that can be implemented in current computational protein design protocols. To this end, we improve upon a previously ...
Christina L. Vizcarra, Naigong Zhang, Shannon A. M...
BSL
2008
97views more  BSL 2008»
13 years 10 months ago
The Complexity of Orbits of Computably Enumerable Sets
The goal of this paper is to announce there is a single orbit of the c.e. sets with inclusion, E, such that the question of membership in this orbit is 1 1-complete. This result an...
Peter Cholak, Rodney G. Downey, Leo Harrington
CSR
2006
Springer
14 years 1 months ago
Complexity of Polynomial Multiplication over Finite Fields
Let Mq (n ) denote the number of multiplications required to compute the coefficients of the product of two polynomials of degree n over a q -element field by means of bilinear alg...
Michael Kaminski