Information theory, combinatorics, and search theory. In memory of Rudolf Ahlswede

DOI10.1007/978-3-642-36899-8MaRDI QIDQ1940489zbMATH OpenOpenAlexFDO

Authors

Publication date 7 March 2013

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-36899-8

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Combinatorics in computer science (68R05) Information theory (general) (94A15) Festschriften (00B30) Proceedings, conferences, collections, etc. pertaining to computer science (68-06) Proceedings, conferences, collections, etc. pertaining to information and communication theory (94-06)

Cited in

(4)

• Optimal Sets of Questions for Twenty Questions
• scientific article; zbMATH DE number 5179810 (Why is no real title available?)
• On partial information retrieval: the unconstrained 100 prisoner problem
• A theory of information with special application to search problems

This page was built for publication: Information theory, combinatorics, and search theory. In memory of Rudolf Ahlswede

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1940489)