Posted by **ChrisRedfield** at Dec. 7, 2014

Published: 2003-01-26 | ISBN: 0691027722, 0691027714 | PDF | 120 pages | 1 MB

Posted by **Grev27** at Jan. 13, 2013

English | ISBN: 0521198666 | edition 2011 | PDF | 308 pages | 1,7 mb

Posted by **Book-er** at Feb. 28, 2012

Ca,.,.,..ge U,ni,.,./sity P.,re.ss | ISBN: 0521198666 | edition 2011 | PDF | 308 pages | 1.7 mb

Games provide mathematical models for interaction. Numerous tasks in computer science can be formulated in game-theoretic terms. This fresh and intuitive way of thinking through complex issues reveals underlying algorithmic questions and clarifies the relationships between different domains. This collection of lectures, by specialists in the field, provides an excellent introduction to various aspects of game theory relevant for applications in computer science that concern program design, synthesis, verification, testing and design of multi-agent or distributed systems.

Posted by **step778** at Aug. 15, 2017

2000 | pages: 358 | ISBN: 0387989110 | PDF | 7,1 mb

Posted by **AvaxGenius** at July 24, 2017

English | PDF | 2018 | 395 Pages | ISBN : 3319531379 | 4.85 MB

The fourth volume of Rudolf Ahlswede’s lectures on Information Theory is focused on Combinatorics. Ahlswede was originally motivated to study combinatorial aspects of Information Theory via zero-error codes: in this case the structure of the coding problems usually drastically changes from probabilistic to combinatorial. The best example is Shannon’s zero error capacity, where independent sets in graphs have to be examined. The extension to multiple access channels leads to the Zarankiewicz problem.

Posted by **AvaxGenius** at July 15, 2017

The fourth volume of Rudolf Ahlswede’s lectures on Information Theory is focused on Combinatorics. Ahlswede was originally motivated to study combinatorial aspects of Information Theory via zero-error codes: in this case the structure of the coding problems usually drastically changes from probabilistic to combinatorial. The best example is Shannon’s zero error capacity, where independent sets in graphs have to be examined. The extension to multiple access channels leads to the Zarankiewicz problem.

Posted by **AvaxGenius** at July 1, 2017

English | PDF | 2018 | 395 Pages | ISBN : 3319531379 | 4.85 MB

The fourth volume of Rudolf Ahlswede’s lectures on Information Theory is focused on Combinatorics. Ahlswede was originally motivated to study combinatorial aspects of Information Theory via zero-error codes: in this case the structure of the coding problems usually drastically changes from probabilistic to combinatorial. The best example is Shannon’s zero error capacity, where independent sets in graphs have to be examined. The extension to multiple access channels leads to the Zarankiewicz problem.

Posted by **thingska** at March 27, 2017

English | 1993 | ISBN: 0521435935 | 172 Pages | PDF | 4.93 MB

Posted by **Jeembo** at March 18, 2017

English | 2003 | ISBN: 0521525489 | 238 Pages | PDF | 2.4 MB

This introduction to the main ideas of algebraic and geometric invariant theory assumes only a minimal background in algebraic geometry, algebra and representation theory.

Posted by **interes** at March 4, 2017

English | 2012 | ISBN: 1480215236 | 656 pages | PDF | 2,4 MB