3415 search results - page 350 / 683 » Lower bounds on kernelization |
156
click to vote
SWAT
2000
Springer
15 years 10 months ago
2000
Springer
We define external memory (or I/O) models which capture space complexity and develop a general technique for deriving I/O-space trade-offs in these models from internal memory mode...
200
click to vote
CSL
1995
Springer
15 years 10 months ago
1995
Springer
We propose so called contraction free sequent calculi for the three prominent modal logics K, T, and S4. Deduction search in these calculi is shown to provide more efficient decisi...
199
click to vote
CIAC
2010
Springer
15 years 10 months ago
2010
Springer
We investigate the relationship between two kinds of vertex colorings of graphs: uniquemaximum colorings and conflict-free colorings. In a unique-maximum coloring, the colors are ...
169
click to vote
CDC
2009
IEEE
15 years 10 months ago
2009
IEEE
Abstract— This paper addresses a problem of finding an optimal dynamic quantizer for nonlinear control subject to discretevalued signal constraints. The quantizers to be studied...
184
click to vote
APVIS
2008
15 years 8 months ago
2008
We define the concept of crossing numbers for simultaneous graphs by extending the crossing number problem of traditional graphs. We discuss differences to the traditional crossin...