Title of article
On completing latin squares Original Research Article
Author/Authors
Stephen T. Easton، نويسنده , , R. Gary Parker، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2001
Pages
15
From page
167
To page
181
Abstract
In 1984, Colbourn proved that completing a partially filled latin square is NP-complete. In this paper, we tighten the Colbourn result by showing that completing a partially filled square remains hard even if no more than three unfilled cells exist in any row or column of the square and where only three integers are available.
Keywords
Complexity theory , Latin square
Journal title
Discrete Applied Mathematics
Serial Year
2001
Journal title
Discrete Applied Mathematics
Record number
885268
Link To Document