Sciweavers

3208 search results - page 5 / 642
» A Lower Bound for Primality
Sort
View
ASPDAC
2005
ACM
101views Hardware» more  ASPDAC 2005»
14 years 1 months ago
Lower bounds for dynamic BDD reordering
— In this paper we present new lower bounds on BDD size. These lower bounds are derived from more general lower bounds that recently were given in the context of exact BDD minimi...
Rüdiger Ebendt, Rolf Drechsler
RANDOM
2001
Springer
14 years 2 days ago
On the Equivalence between the Primal-Dual Schema and the Local-Ratio Technique
We discuss two approximation approaches, the primal-dual schema and the local-ratio technique. We present two relatively simple frameworks, one for each approach, which extend know...
Reuven Bar-Yehuda, Dror Rawitz
STACS
2009
Springer
14 years 2 months ago
A Stronger LP Bound for Formula Size Lower Bounds via Clique Constraints
We introduce a new technique proving formula size lower bounds based on the linear programming bound originally introduced by Karchmer, Kushilevitz and Nisan [11] and the theory of...
Kenya Ueno