Constant-Size Tileset for Solving an NP-Complete Problem in Nondeterministic Linear Time (Q5452688)
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 5259520
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Constant-Size Tileset for Solving an NP-Complete Problem in Nondeterministic Linear Time |
scientific article; zbMATH DE number 5259520 |
Statements
Constant-Size Tileset for Solving an NP-Complete Problem in Nondeterministic Linear Time (English)
0 references
4 April 2008
0 references
0.9130268096923828
0 references
0.8537515997886658
0 references
0.8187626600265503
0 references
0.8166265487670898
0 references
0.8119097948074341
0 references
