On the complexity of searching in trees and partially ordered structures (Q650925)
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: On the complexity of searching in trees and partially ordered structures |
scientific article; zbMATH DE number 5987009
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the complexity of searching in trees and partially ordered structures |
scientific article; zbMATH DE number 5987009 |
Statements
On the complexity of searching in trees and partially ordered structures (English)
0 references
7 December 2011
0 references
decision tree
0 references
search problems
0 references
NP-completeness
0 references
search in posets
0 references
hardness of approximability
0 references
0 references
0.9008905291557312
0 references
0.8648532629013062
0 references
0.848473846912384
0 references
0.8434629440307617
0 references
0.8192663192749023
0 references
