1169 search results - page 87 / 234 » Degrees of monotone complexity |
120
Voted
STOC
2007
ACM
16 years 1 months ago
2007
ACM
The design of algorithms on complex networks, such as routing, ranking or recommendation algorithms, requires a detailed understanding of the growth characteristics of the network...
109
Voted
AFRICACRYPT
2010
Springer
15 years 7 months ago
2010
Springer
Abstract. The most costly operations encountered in pairing computations are those that take place in the full extension field Fpk . At high levels of security, the complexity of ...
123
click to vote
FSE
2004
Springer
15 years 6 months ago
2004
Springer
This paper presents algebraic attacks on SOBER-t32 and SOBER-t16 without stuttering. For unstuttered SOBER-t32, two different attacks are implemented. In the first attack, we obt...
93
Voted
CORR
2010
Springer
15 years 27 days ago
2010
Springer
In a recent paper Lima, Panario and Wang have provided a new method to multiply polynomials in Chebyshev basis which aims at reducing the total number of multiplication when polyn...
112
click to vote
JGAA
2006
15 years 23 days ago
2006
We consider the problem of constructing a minimal cycle-breaking set of turns for a given undirected graph. This problem is important for deadlock-free wormhole routing in compute...