1450 search results - page 92 / 290 » On the Complexity of Hardness Amplification |
168
click to vote
ASIACRYPT
2009
Springer
16 years 27 days ago
2009
Springer
We demonstrate how the framework that is used for creating efficient number-theoretic ID and signature schemes can be transferred into the setting of lattices. This results in cons...
156
click to vote
ESA
2009
Springer
16 years 26 days ago
2009
Springer
Abstract. The input of the Edge Multicut problem consists of an undirected graph G and pairs of terminals {s1, t1}, . . . , {sm, tm}; the task is to remove a minimum set of edges s...
156
click to vote
CEC
2007
IEEE
16 years 19 days ago
2007
IEEE
— For complex optimization problems, several population-based heuristics like Multi-Objective Evolutionary Algorithms have been developed. These algorithms are aiming to deliver ...
171
click to vote
IEEEPACT
2007
IEEE
16 years 18 days ago
2007
IEEE
Loop nest optimization is a combinatorial problem. Due to the growing complexity of modern architectures, it involves two increasingly difficult tasks: (1) analyzing the profita...
145
click to vote
IRI
2006
IEEE
16 years 9 days ago
2006
IEEE
With the rapidly increasing complexity of computer systems and the sophistication of hacking tools and techniques, there is a crucial need for computer forensic analysis technique...