Table 3:

Running time (seconds) of the fastest algorithm for each $(k,d)$.

	$k$
		2	3	4	5	6	7	8	9	10	11	12	13	14	15
$d$	1	0	0	0	0	0	0	0	1	5	25	114	528	3382	14028
	2		0	0	0	0	0	0	2	11	46	202	977	5444	22380
	3			0	0	0	0	0	3	18	78	344	2161	10317	46701
	4				0	0	0	0	1	8	55	460	4191	21801	36614
	5					0	0	0	0	4	25	152	1409	11887	53478
	6						0	0	0	3	17	94	659	4423	23922
	7							0	0	1	13	77	504	3008	14864
	8								0	1	7	52	438	2422	11308
	9									0	5	31	258	2128	10003
	10										4	23	210	1809	9197
	11											21	187	1225	7322
	12												184	988	5548
	13													931	4743
	14														4332