Optimal search with positive switch cost is NP-hard (Q1065706)
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: Optimal search with positive switch cost is NP-hard |
scientific article; zbMATH DE number 3924496
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Optimal search with positive switch cost is NP-hard |
scientific article; zbMATH DE number 3924496 |
Statements
Optimal search with positive switch cost is NP-hard (English)
0 references
1985
0 references
NP-hardness
0 references
optimal search
0 references
positive switch cost
0 references
optimal strategy
0 references
0.7572498917579651
0 references
0.7495235800743103
0 references
0.7449419498443604
0 references
0.7432935237884521
0 references
0.7358397841453552
0 references
