On the complexity of Jensen's algorithm for counting fixed polyominoes (Q2457308)
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: On the complexity of Jensen's algorithm for counting fixed polyominoes |
scientific article; zbMATH DE number 5206776
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the complexity of Jensen's algorithm for counting fixed polyominoes |
scientific article; zbMATH DE number 5206776 |
Statements
On the complexity of Jensen's algorithm for counting fixed polyominoes (English)
0 references
30 October 2007
0 references
lattice animals
0 references
polyominoes
0 references
computational complexity
0 references
0.72931969165802
0 references
0.7249799370765686
0 references
0.717642068862915
0 references
0.710970938205719
0 references
