2681 search results - page 29 / 537 » Problem F |
SIAMCOMP
2010
13 years 7 months ago
2010
We provide algorithms to count and enumerate representatives of the (right) ideal classes of an Eichler order in a quaternion algebra defined over a number field. We analyze the ...
GECCO
2009
Springer
14 years 3 months ago
2009
Springer
In this paper, we consider multi-objective evolutionary algorithms for the Vertex Cover problem in the context of parameterized complexity. We relate the runtime of our algorithms...
INDOCRYPT
2001
Springer
14 years 1 months ago
2001
Springer
In this paper, the authors analyze the Gaudry–Hess–Smart (GHS) Weil descent attack on the elliptic curve discrete logarithm problem (ECDLP) for elliptic curves defined over c...
AISB
1995
Springer
14 years 12 days ago
1995
Springer
This paper discusses a series of recombination operators for the timetabling problem. These operators act upon a direct representation of the timetable and maintain the property of...
STOC
2006
ACM
14 years 2 months ago
2006
ACM
We show that for any constant ε > 0, there is no Ω(log1−ε M)approximation algorithm for the directed congestion minimization problem on networks of size M unless NP ⊆ Z...