3415 search results - page 35 / 683 » Lower Bounds for Kernelizations |
TIT
2010
13 years 5 months ago
2010
In this paper, we give a lower bound for the optimum distance profiles of the second-order Reed
FOCS
2006
IEEE
14 years 5 months ago
2006
IEEE
An additive spanner of an unweighted undirected graph G with distortion d is a subgraph H such that for any two vertices u, v ∈ G, we have δH(u, v) ≤ δG(u, v) + d. For every...
UC
2005
Springer
14 years 4 months ago
2005
Springer
We present lower bounds on the computational power of an optical model of computation called the C2-CSM. We show that C2-CSM time is at least as powerful as sequential space, thus ...
GLVLSI
2000
IEEE
14 years 3 months ago
2000
IEEE
In this paper we present a novel and fast estimation technique that produces tight latency lower bounds for Data Flow Graphs representing time critical segments of the application...
ACISP
1997
Springer
14 years 3 months ago
1997
Springer
Abstract. Highly nonlinear Boolean functions occupy an important position in the design of secure block as well as stream ciphers. This paper proves two new lower bounds on the non...