3415 search results - page 5 / 683 » Lower Bounds for Kernelizations |
MFCS
2010
Springer
13 years 8 months ago
2010
Springer
Karchmer, Kushilevitz and Nisan formulated the formula size problem as an integer programming problem called the rectangle bound and introduced a technique called the LP bound, whi...
RTAS
2007
IEEE
14 years 4 months ago
2007
IEEE
This paper focuses on a technique to empower commercial-off-the-shelf (COTS) systems with an execution environment, and corresponding services, to support realtime and embedded ap...
ASPDAC
2005
ACM
14 years 3 months ago
2005
ACM
— 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...
SODA
2012
ACM
12 years 7 days ago
2012
ACM
The Odd Cycle Transversal problem (OCT) asks whether a given graph can be made bipartite by deleting at most k of its vertices. In a breakthrough result Reed, Smith, and Vetta (Op...
SODA
1992
ACM
13 years 11 months ago
1992
ACM
An m