Table for CAN(2,k,3) for k up to 20000

Locate the k in the first column that is at least as large as the number of factors in which you are interested. Then let N be the number of rows (tests) given in the second column. A CA(N;2,k,3) exists according to a construction in the reference (cryptically) given in the third column. The accompanying graph plots N vertically against log k (base 10).

Go to Global Menu.

Change t: +

Change v: - +

k N Source 4 9 orthogonal array 5 11 group 1-rotational (Meagher-Stevens, Colbourn) 7 12 simulated annealing (Cohen) 9 13 simulated annealing (Cohen) 10 14 simulated annealing (Cohen) 20 15 tabu search (Nurmela) 21 16 tabu search (Zekaoui) 24 17 tabu search (Nurmela) 30 18 tabu search (Nurmela) 36 19 tabu search (Nurmela) 43 20 tabu search (Nurmela) 74 21 CMMSSY 2.3 94 23 CMMSSY 2.2 134 24 CMMSSY 2.3 174 25 CMMSSY 2.3 194 26 CMMSSY 2.2 394 27 CMMSSY 2.3 414 28 CMMSSY 2.3 474 29 CMMSSY 2.3 594 30 CMMSSY 2.3 714 31 CMMSSY 2.3 854 32 CMMSSY 2.3 1474 33 CMMSSY 2.3 1796 35 CMMSSY 2.2 2364 36 CMMSSY 2.2 3030 37 CMMSSY 2.2 3766 38 CMMSSY 2.2 6836 39 CMMSSY 2.2 7182 40 CMMSSY 2.2 8238 41 CMMSSY 2.2 10296 42 CMMSSY 2.2 12372 43 CMMSSY 2.2 14794 44 CMMSSY 2.2 20000 45 CMMSSY 2.2

Graph: