## Combinatorial search problems: lectures held at the Department for Automation and Information, June 1972 |

### What people are saying - Write a review

We haven't found any reviews in the usual places.

### Contents

Introduction | 5 |

Connections with Noiseless Encoding | 11 |

Results | 19 |

Copyright | |

2 other sections not shown

### Other editions - View all

### Common terms and phrases

ai{q alphabetical code answer Assume average code length average number average test number Baranyai belongs binary Change the code chemical elements choose code is prefix code with average code word COMBINATORIAL SEARCH completely separating system construction sequence contains xt defective elements Denote depend Determine the minimal determine the number disjoint subsets e,CO easy element by element equal arm balance equivalent finite set fk(n given Hu and Tucker Huffman algorithm Huffman-procedure independently with probability information theory integer Lemma logm logn lower bound maximal length maximal number maximal test number minimal average length minimum Noiseless Coding Theorem number of test obtain optimal code optimal strategy permutations prefix code prefix property probability pk proved Renyi 196lb restriction saqou search problem search theory segment solved subset containing subtree terminal nodes testing subsets Theorem 11 unknown element weight x^eA