How to decompose a binary matrix into three \(hv\)-convex polyominoes (Q4924481)
From MaRDI portal
!
WARNING
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 6169469
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | How to decompose a binary matrix into three \(hv\)-convex polyominoes |
scientific article; zbMATH DE number 6169469 |
Statements
How to Decompose a Binary Matrix into Three hv-convex Polyominoes (English)
0 references
31 May 2013
0 references
computational complexity
0 references
matrix decomposition
0 references
convex polyomino
0 references
0.9225614666938782
0 references
0.7785344123840332
0 references
0.7681217193603516
0 references
0.7598453760147095
0 references
0.7567563652992249
0 references
