36781 search results - page 76 / 7357 » Parameterizing by the Number of Numbers |
ARSCOM
2004
14 years 10 months ago
2004
It was shown by Abrham that the number of pure Skolem sequences of order n, n 0 or 1 (mod 4), and the number of extended Skolem sequences of order n, are both bounded below by 2 ...
COMBINATORICS
2002
14 years 9 months ago
2002
We investigate the numbers dk of all (isomorphism classes of) distributive lattices with k elements, or, equivalently, of (unlabeled) posets with k antichains. Closely related and...
MOC
2000
14 years 9 months ago
2000
We report the discovery of a new factor for each of the Fermat numbers F13, F15, F16. These new factors have 27, 33 and 27 decimal digits respectively. Each factor was found by the...
MP
2010
14 years 8 months ago
2010
Adding cuts based on copositive matrices, we propose to improve Lov´asz’ bound θ on the clique number and its tightening θ introduced by McEliece, Rodemich, Rumsey, and Schri...
112
click to vote
ECCC
2010
14 years 4 months ago
2010
Efremenko showed locally-decodable codes of sub-exponential length that can handle close to 1 6 fraction of errors. In this paper we show that the same codes can be locally unique...