The complexity of completing partial Latin squares (Q793029)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: The complexity of completing partial Latin squares |
scientific article; zbMATH DE number 3855122
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The complexity of completing partial Latin squares |
scientific article; zbMATH DE number 3855122 |
Statements
The complexity of completing partial Latin squares (English)
0 references
1984
0 references
With the aid of a result of \textit{I. Holyer} [see SIAM J. Comput. 10, 713- 717 (1981; Zbl 0468.68069)] the author was able to prove that completing partial Latin squares is NP-complete.
0 references
partial Latin squares
0 references
partitioning tripartite graphs
0 references
NP-complete
0 references
0.9343209
0 references
0.9202689
0 references
0.9068159
0 references
0 references
