32 search results - page 1 / 7 » On the Complexity of the Montes Ideal Factorization Algorith... |
ANTS
2010
Springer
13 years 8 months ago
2010
Springer
Let p be a rational prime and let Φ(X) be a monic irreducible polynomial in Z[X], with nΦ = deg Φ and δΦ = vp(disc Φ). In [13] Montes describes an algorithm for the decomposi...
WSC
2000
13 years 6 months ago
2000
The calculation of value-at-risk (VAR) for large portfolios of complex instruments is among the most demanding and widespread computational challenges facing the financial industr...
ACG
2009
Springer
13 years 8 months ago
2009
Springer
Abstract. Monte-Carlo tree search, especially the UCT algorithm and its enhancements, have become extremely popular. Because of the importance of this family of algorithms, a deepe...
ISSAC
2005
Springer
13 years 10 months ago
2005
Springer
We present algorithms that compute the linear and quadratic factors of supersparse (lacunary) bivariate polynomials over the rational numbers in polynomial-time in the input size....
ICC
2009
IEEE
13 years 11 months ago
2009
IEEE
— In this paper, we propose a novel low complexity soft-in soft-out (SISO) equalizer using the Markov chain Monte Carlo (MCMC) technique. Direct application of MCMC to SISO equal...