Bounds and complexity for the tessellation problem (Q6489469)
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 7835260
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Bounds and complexity for the tessellation problem |
scientific article; zbMATH DE number 7835260 |
Statements
Bounds and complexity for the tessellation problem (English)
0 references
22 April 2024
0 references
clique graph
0 references
tessellation
0 references
NP-complete
0 references
staggered quantum walk
0 references
0.8681572079658508
0 references
0.8365745544433594
0 references
0.8282935619354248
0 references
0.7636844515800476
0 references
0.746894121170044
0 references
