DocumentCode :
2182467
Title :
Information bounds are good for search problems on ordered data structures
Author :
Linial, Nathan ; Saks, Michael E.
fYear :
1983
fDate :
7-9 Nov. 1983
Firstpage :
473
Lastpage :
475
Abstract :
The complexity of the search problem for a very broad class of data structures is estimated. The lower (Information Theoretic) bound and the upper bound differ by a small multiplicative constant.
Keywords :
Computer science; Data structures; Mathematics; Partitioning algorithms; Search problems; Upper bound;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Foundations of Computer Science, 1983., 24th Annual Symposium on
Conference_Location :
Tucson, AZ, USA
ISSN :
0272-5428
Print_ISBN :
0-8186-0508-1
Type :
conf
DOI :
10.1109/SFCS.1983.27
Filename :
4568113
Link To Document :
بازگشت