790 search results - page 54 / 158 » Subexponential Parameterized Algorithms |
111
click to vote
PC
1998
15 years 2 months ago
1998
Linear congruential generators (LCGs) remain the most popular method of pseudorandom number generation on digital computers. Ease of implementation has favored implementing LCGs wi...
95
Voted
IPL
2008
15 years 2 months ago
2008
We describe a new algorithm for the problem of perfect sorting a signed permutation by reversals. The worst-case time complexity of this algorithm is parameterized by the maximum p...
112
click to vote
ISCAS
2003
IEEE
15 years 8 months ago
2003
IEEE
In this paper, we treat the turbo decoding algorithm as a dynamical system parameterized by the SNR (signal-to-noise ratio). A whole range of nonlinear phenomena, including chaos ...
108
Voted
STOC
2003
ACM
16 years 2 months ago
2003
ACM
A real multivariate polynomial p(x1, . . . , xn) is said to sign-represent a Boolean function f : {0, 1}n {-1, 1} if the sign of p(x) equals f(x) for all inputs x {0, 1}n. We gi...
112
Voted
ISSAC
2009
Springer
15 years 9 months ago
2009
Springer
In this work we relate the deterministic complexity of factoring polynomials (over finite fields) to certain combinatorial objects, we call m-schemes, that are generalizations o...