3208 search results - page 139 / 642 » A Lower Bound for Primality |
139
click to vote
ICALP
2005
Springer
15 years 12 months ago
2005
Springer
We study interval coloring problems and present new upper and lower bounds for several variants. We are interested in four problems, online coloring of intervals with and without b...
146
click to vote
ASIACRYPT
2000
Springer
15 years 10 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...
147
click to vote
ASIACRYPT
2000
Springer
15 years 10 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, ...
145
click to vote
EUROPAR
2006
Springer
15 years 10 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...
138
click to vote
DLT
2007
15 years 8 months ago
2007
Abstract. Inapproximability results concerning minimization of nondeterministic finite automata relative to given deterministic finite automata were obtained only recently, modul...