Finding the best CAFE is NP-hard (Q3557033)
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 5702165
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Finding the best CAFE is NP-hard |
scientific article; zbMATH DE number 5702165 |
Statements
Finding the Best CAFE Is NP-Hard (English)
0 references
27 April 2010
0 references
0.9392454028129578
0 references
0.7943658232688904
0 references
0.7625875473022461
0 references
0.7367864847183228
0 references
0.7367809414863586
0 references
