A lower bound for the complexity of inclusive search in the class of tree circuits (Q4522800)
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: A lower bound for the complexity of inclusive search in the class of tree circuits |
scientific article; zbMATH DE number 1548612
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A lower bound for the complexity of inclusive search in the class of tree circuits |
scientific article; zbMATH DE number 1548612 |
Statements
A lower bound for the complexity of inclusive search in the class of tree circuits (English)
0 references
22 November 2001
0 references
information search
0 references
inclusive search
0 references
tree information networks
0 references
lower bound for complexity
0 references
repetition-free information trees
0 references
0.7919449806213379
0 references
0.7823196053504944
0 references
0.7397567629814148
0 references
