A lower bound for the complexity of inclusive search in the class of tree circuits (Q4522800): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set OpenAlex properties. |
||
| (One intermediate revision by one other user not shown) | |||
| 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.1515/dma.1998.8.1.99 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2022847863 / rank | |||
Normal rank | |||
Latest revision as of 19:26, 19 March 2024
scientific article; zbMATH DE number 1548612
| Language | Label | Description | Also known as |
|---|---|---|---|
| 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
