3415 search results - page 158 / 683 » Lower Bounds for Kernelizations |
127
click to vote
SODA
2004
ACM
15 years 6 months ago
2004
ACM
In this paper, we extend Rothemund and Winfree's examination of the tile complexity of tile self-assembly [6]. They provided a lower bound of ( log N log log N ) on the tile ...
131
click to vote
APPML
2006
15 years 4 months ago
2006
We show that a combinatorial question which has been studied in connection with lower bounds for the knapsack problem by Brimkov and Dantchev (2001) is related to threshold graphs...
CORR
2006
Springer
15 years 4 months ago
2006
Springer
Abstract-- Pseudocodewords of q-ary LDPC codes are examined and the weight of a pseudocodeword on the q-ary symmetric channel is defined. The weight definition of a pseudocodeword ...
132
click to vote
ORL
2006
15 years 4 months ago
2006
We prove a lower bound on the optimal price for a fairly large class of blocking systems with general arrival and service processes, determine optimal price expressions for M/M/1/...
136
click to vote
APAL
2004
15 years 4 months ago
2004
The model-checking problem for a logic L on a class C of structures asks whether a given L-sentence holds in a given structure in C. In this paper, we give super-exponential lower...