No easy puzzles: hardness results for jigsaw puzzles (Q2346997)
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 6439764
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | No easy puzzles: hardness results for jigsaw puzzles |
scientific article; zbMATH DE number 6439764 |
Statements
No easy puzzles: hardness results for jigsaw puzzles (English)
0 references
26 May 2015
0 references
jigsaw puzzle
0 references
parsimonious testing
0 references
communication complexity
0 references
subgraph isomorphism
0 references
0.8474913239479065
0 references
0.8090673089027405
0 references
0.7867952585220337
0 references
0.7829647660255432
0 references
0.7820689082145691
0 references
