3415 search results - page 144 / 683 » Lower Bounds for Kernelizations |
114
click to vote
ASIACRYPT
2000
Springer
15 years 8 months ago
2000
Springer
A discrete-logarithm algorithm is called generic if it does not exploit the specific representation of the cyclic group for which it is supposed to compute discrete logarithms. Su...
116
click to vote
ASIACRYPT
2000
Springer
15 years 8 months ago
2000
Springer
We establish, for the first time, an explicit and simple lower bound on the nonlinearity Nf of a Boolean function f of n variables satisfying the avalanche criterion of degree p, ...
116
click to vote
EUROPAR
2006
Springer
15 years 8 months ago
2006
Springer
Abstract. We consider parallel prefix computation on processors of different and possibly changing speeds. Extending previous works on identical processors, we provide a lower boun...
113
click to vote
DLT
2007
15 years 6 months ago
2007
Abstract. Inapproximability results concerning minimization of nondeterministic finite automata relative to given deterministic finite automata were obtained only recently, modul...
133
click to vote
DMIN
2006
15 years 5 months ago
2006
Abstract-- In this paper we consider d-dimensional spatiotemporal data (d 1) and ways to approximate and index it. We focus on indexing such data for similarity matching using orth...