128
Voted
ARSCOM
2008
15 years 3 months ago
2008
A Greedy Defining Set is a set of entries in a Latin square with the property that when the square is systematically filled in with a greedy algorithm, the greedy algorithm succee...