417 search results - page 55 / 84 » Running Time Predictions for Factoring Algorithms |
75
Voted
SC
2004
ACM
15 years 3 months ago
2004
ACM
There exist many application classes for which the users have significant flexibility in the quality of output they desire. At the same time, there are other constraints, such a...
DOCENG
2007
ACM
15 years 1 months ago
2007
ACM
Optimisation of real world Variable Data printing (VDP) documents is a difficult problem because the interdependencies between layout functions may drastically reduce the number o...
ANTS
2004
Springer
15 years 3 months ago
2004
Springer
We present a technique to recover f ∈ Q(ζp) where ζp is a primitive pth root of unity for a prime p, given its norm g = f ∗ ¯f in the totally real field Q(ζp + ζ−1 p )....
102
Voted
IWPEC
2010
Springer
14 years 7 months ago
2010
Springer
Abstract. Inclusion/exclusion branching is a way to branch on requirements imposed on problems, in contrast to the classical branching on parts of the solution. The technique turne...
STOC
1994
ACM
15 years 1 months ago
1994
ACM
Shannon's Coding Theorem shows that in order to reliably transmit a message of T bits over a noisy communication channel, only a constant slowdown factor is necessary in the ...