Tiling with three polygons is undecidable (Q7312685)
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 8238529
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Tiling with three polygons is undecidable |
scientific article; zbMATH DE number 8238529 |
Statements
Tiling with three polygons is undecidable (English)
0 references
11 August 2026
0 references
