| Martin Aigner - 2007 - Liczba stron: 566
Combinatorial enumeration is a readily accessible subject full of easily stated, but sometimes tantalizingly difficult problems. This book leads the reader in a leisurely way ... | |
| Martin Aigner - 2012 - Liczba stron: 493
This book offers a well-organized, easy-to-follow introduction to combinatorial theory, with examples, notes and exercises. ". . . a very good introduction to combinatorics ... | |
| Martin Aigner - 1988 - Liczba stron: 380
Introduces the basic ideas and most interesting instances of search problems. The first chapter discusses combinatorial search. Following chapters, which are relatively ... | |
| Günter M. Ziegler - 2012 - Liczba stron: 388
Based on a graduate course at the Technische Universität, Berlin, these lectures present a wealth of material on the modern theory of convex polytopes. The straightforward ... | |
| Gil Kalai, Günter M. Ziegler - 2000 - Liczba stron: 236
Questions that arose from linear programming and combinatorial optimization have been a driving force for modern polytope theory, such as the diameter questions motivated by ... | |
| Martin Aigner - Liczba stron: 406
The advent of fast computers and the search for efficient algorithms revolutionized combinatorics and brought about the field of discrete mathematics. This book is an ... | |
| Martin Aigner, Ehrhard Behrends - 2010 - Liczba stron: 346
The authors are renowned mathematicians; their presentations cover a wide range of topics. From compact discs to the stock exchange, from computer tomography to traffic routing ... | |
| Leith Hathout - 2007 - Liczba stron: 266
Each chapter presents a new detective story with a mathematical puzzle at its core. Readers must test skills in mathematics and physics and enjoy Ravi's clever analysis of the ... | |
| |