1013 search results - page 2 / 203 » A Subexponential Algorithm for Abstract Optimization Problem... |
ANTS
2000
Springer
13 years 10 months ago
2000
Springer
Abstract. Essentially all subexponential time algorithms for the discrete logarithm problem over nite elds are based on the index calculus idea. In proposing cryptosystems based on...
STACS
2010
Springer
14 years 22 days ago
2010
Springer
Abstract. A parametric weighted graph is a graph whose edges are labeled with continuous real functions of a single common variable. For any instantiation of the variable, one obta...
ICALP
2005
Springer
13 years 11 months ago
2005
Springer
Given a graph G = (V, E) and positive integral vertex weights w : V → N, the max-coloring problem seeks to find a proper vertex coloring of G whose color classes C1, C2, . . . ,...
SOCO
2012
Springer
12 years 1 months ago
2012
Springer
Abstract Population-based meta-heuristics are algorithms that can obtain very good results for complex continuous optimization problems in a reduced amount of time. These search al...
SCN
2010
Springer
13 years 4 months ago
2010
Springer
Abstract. Lattice reduction is known to be a very powerful tool in modern cryptanalysis. In the literature, there are many lattice reduction algorithms that have been proposed with...