Combinatorial Search Problems: Lectures held at the Department for Automation and Information June 1972 |
Contents
Introduction | 5 |
Connections with Noiseless Encoding | 11 |
Results | 19 |
Copyright | |
2 other sections not shown
Other editions - View all
Common terms and phrases
algorithm alphabetical code answer Assume average code length average length belongs better binary called chemical choose code word coding theorem completely condition connected consider consist construction contains correspondence defective coin defective elements defined Denote depend determine disjoint divide e,ci easy equivalent estimation exact exactly example exists finite set fixed given gives hand side hold Huffman identify independently integer interesting known least lecture Lemma Lmin logn lower bound maximal maximal number means mediocre method minimal minimum number of test obtain optimal pair permutations possible prefix code probability problem proof proved question Rényi restriction satisfying says segment separating system sequence sizes Sobel solution solved step strategy subsets symbols testing subsets Theorem theory tion tive unknown element weight