4934 search results - page 169 / 987 » complexity 2008 |
128
click to vote
CANS
2009
Springer
15 years 11 months ago
2009
Springer
The XSL attack when applied on BES-128 has been shown to have an attack complexity of 2100 , which is faster than exhaustive search. However at FSE 2007, Lim and Khoo analyzed the ...
131
click to vote
IPL
2007
15 years 4 months ago
2007
We consider the problem Monet—given two monotone formulas ϕ in DNF and ψ in CNF, decide whether they are equivalent. While Monet is probably not coNPhard, it is a long standin...
130
click to vote
TSP
2008
15 years 4 months ago
2008
In this paper, we present a near ML-achieving sphere decoding algorithm that reduces the number of search operations in the sphere-constrained search. Specifically, by adding a pro...
146
click to vote
AAAI
2008
15 years 6 months ago
2008
The search of a precise measure of what hardness of SAT instances means for state-of-the-art solvers is a relevant research question. Among others, the space complexity of treelik...
123
click to vote
CCCG
2008
15 years 6 months ago
2008
In this paper we investigate the Voronoi diagram that is induced by a set of sites in the plane, where each site's precise location is uncertain but is known to be within a p...