Sciweavers

1695 search results - page 11 / 339
» Linear, Polynomial or Exponential
Sort
View
86
Voted
COMBINATORICS
1999
70views more  COMBINATORICS 1999»
15 years 9 days ago
Derivative Polynomials, Euler Polynomials, and Associated Integer Sequences
Let Pn and Qn be the polynomials obtained by repeated differentiation of the tangent and secant functions respectively. From the exponential generating functions of these polynomia...
Michael E. Hoffman
91
Voted
ECAI
2010
Springer
15 years 25 days ago
The Necessity of Bounded Treewidth for Efficient Inference in Bayesian Networks
Abstract. Algorithms for probabilistic inference in Bayesian networks are known to have running times that are worst-case exponential in the size of the network. For networks with ...
Johan Kwisthout, Hans L. Bodlaender, Linda C. van ...
74
Voted
ISSAC
2004
Springer
71views Mathematics» more  ISSAC 2004»
15 years 6 months ago
Sharp estimates for triangular sets
We study the triangular representation of zero-dimensional varieties defined over the rational field (resp. a rational function field). We prove polynomial bounds in terms of i...
Xavier Dahan, Éric Schost
ISSAC
2009
Springer
121views Mathematics» more  ISSAC 2009»
15 years 7 months ago
Faster real feasibility via circuit discriminants
We show that detecting real roots for honestly n-variate (n + 2)-nomials (with integer exponents and coefficients) can be done in time polynomial in the sparse encoding for any ...
Frédéric Bihan, J. Maurice Rojas, Ca...
110
Voted
AAECC
2005
Springer
131views Algorithms» more  AAECC 2005»
15 years 17 days ago
Noisy interpolation of sparse polynomials in finite fields
Abstract We consider a polynomial analogue of the hidden number problem introduced by Boneh andVenkatesan, namely the sparse polynomial noisy interpolation problem of recovering an...
Igor Shparlinski, Arne Winterhof