On the Complexity of Searching in Trees: Average-Case Minimization (Q3587405): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set OpenAlex properties. |
||
| (3 intermediate revisions by 2 users not shown) | |||
| Property / author | |||
| Property / author: Q225410 / rank | |||
| Property / author | |||
| Property / author: Eduardo Sany Laber / rank | |||
Normal rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/978-3-642-14165-2_45 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1932722758 / rank | |||
Normal rank | |||
Latest revision as of 22:52, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the Complexity of Searching in Trees: Average-Case Minimization |
scientific article |
Statements
On the Complexity of Searching in Trees: Average-Case Minimization (English)
0 references
7 September 2010
0 references
