A lower bound for the complexity of inclusive search in the class of tree circuits

DOI10.1515/DMA.1998.8.1.99zbMath0972.94051OpenAlexW2022847863MaRDI QIDQ4522800

El'yar E. Gasanov

Publication date: 22 November 2001

Published in: Discrete Mathematics and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1515/dma.1998.8.1.99

zbMATH Keywords

information searchinclusive searchlower bound for complexityrepetition-free information treestree information networks

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Information storage and retrieval of data (68P20) Coding theorems (Shannon theory) (94A24)

This page was built for publication: A lower bound for the complexity of inclusive search in the class of tree circuits