Information Theory, Combinatorics, and Search Theory

Information Theory, Combinatorics, and Search Theory

4.11 - 1251 ratings - Source

This volume is dedicated to the memory of Rudolf Ahlswede, who passed away in December 2010. The Festschrift contains 36 thoroughly refereed research papers from a memorial symposium, which took place in July 2011. The four macro-topics of this workshop: theory of games and strategic planning; combinatorial group testing and database mining; computational biology and string matching; information coding and spreading and patrolling on networks; provide a comprehensive picture of the vision Rudolf Ahlswede put forward of a broad and systematic theory of search.Springer, Heidelberg (1981) Gasser, R.: Harnessing computational resources for efficient exhaustive search. Doctoral ... Cambridge University Press (1998), http:// Garey, M.R., Johnson, D.S.: Computers and intractability - a guide to the theory of NP-completeness. ... Cambridge University Press (2010) Lichtenstein, D., Sipser, M.: Go is polynomial- space hard.

Title:Information Theory, Combinatorics, and Search Theory
Author: Harout Aydinian, Ferdinando Cicalese, Christian Deppe
Publisher:Springer - 2013-03-09

You must register with us as either a Registered User before you can Download this Book. You'll be greeted by a simple sign-up page.

Once you have finished the sign-up process, you will be redirected to your download Book page.

How it works:
  • 1. Register a free 1 month Trial Account.
  • 2. Download as many books as you like (Personal use)
  • 3. Cancel the membership at any time if not satisfied.

Click button below to register and download Ebook
Privacy Policy | Contact | DMCA