On the computational complexity of bridgecard (Q5963617)
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 6544305
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the computational complexity of bridgecard |
scientific article; zbMATH DE number 6544305 |
Statements
On the computational complexity of bridgecard (English)
0 references
23 February 2016
0 references
bridgecard
0 references
computational complexity
0 references
approximation algorithm
0 references
0.7510488033294678
0 references
0.7500753998756409
0 references
0.7495571374893188
0 references
0.7425320744514465
0 references
0.7403055429458618
0 references
