258 search results - page 8 / 52 » New Lower Bounds for Heilbronn Numbers |
CORR
2010
Springer
13 years 5 months ago
2010
Springer
A new fast (real time) sorter of binary numbers by one-dimensional cellular automata is proposed. It sorts a list of n numbers represented by k-bits each in exactly nk steps. This ...
CPAIOR
2005
Springer
14 years 1 months ago
2005
Springer
Abstract. The NValue constraint counts the number of different values assigned to a vector of variables. Propagating generalized arc consistency on this constraint is NP-hard. We ...
EUROPAR
2005
Springer
14 years 1 months ago
2005
Springer
Abstract. We address the call control problem in wireless cellular networks that utilize Frequency Division Multiplexing (FDM) technology. In such networks, many users within the s...
JCT
2007
13 years 7 months ago
2007
Let G be a simple graph with n vertices and m edges. Let ω(G) and α(G) be the numbers of vertices of the largest clique and the largest independent set in G, respectively. In th...
EUROCRYPT
2003
Springer
14 years 25 days ago
2003
Springer
Perfectly secret message transmission can be realized with only partially secret and weakly correlated information shared by the parties as soon as this information allows for the ...