Polynomial algorithm for solving cross-matching puzzles (Q2148745)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7547673
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Polynomial algorithm for solving cross-matching puzzles |
scientific article; zbMATH DE number 7547673 |
Statements
Polynomial algorithm for solving cross-matching puzzles (English)
0 references
24 June 2022
0 references
cross-matching puzzle
0 references
efficient algorithm
0 references
time complexity
0 references
0.6779594421386719
0 references
0.6609862446784973
0 references
0.6567877531051636
0 references
0.6560152173042297
0 references
