3208 search results - page 150 / 642 » A Lower Bound for Primality |
181
click to vote
AAAI
2008
15 years 8 months ago
2008
This paper investigates the impact of symbolic search for solving domain-independent action planning problems with binary decision diagrams (BDDs). Polynomial upper and exponential...
157
click to vote
SODA
2004
ACM
15 years 7 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 ...
151
click to vote
APPML
2006
15 years 6 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 6 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 ...
163
click to vote
ORL
2006
15 years 6 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/...