167 search results - page 1 / 34 » A New Lower Bound for A(17, 6, 6) |
ARSCOM
2007
13 years 5 months ago
2007
We construct a record-breaking binary code of length 17, minimal distance 6, constant weight 6, and containing 113 codewords.
COMBINATORICS
1999
13 years 5 months ago
1999
In this article we use two different methods to find new lower bounds for some multicolored Ramsey numbers. In the first part we use the finite field method used by Greenwood and ...
STOC
2006
ACM
14 years 5 months ago
2006
ACM
Local Search problem, which finds a local minimum of a black-box function on a given graph, is of both practical and theoretical importance to combinatorial optimization, complexi...
ISQED
2011
IEEE
12 years 9 months ago
2011
IEEE
The extent to which the 6T SRAM bit cell can be perpetuated through continued scaling is of enormous technological and economic importance. Understanding the growing limitations i...
COMBINATORICS
2000
13 years 5 months ago
2000
We give new lower bounds for the Schur numbers S(6) and S(7). This will imply new lower bounds for the Multicolor Ramsey Numbers R6(3) and R7(3). We also make several observations...