This book is a brief and focused introduction to the reverse mathematics and computability theory of combinatorial principles, an area of research which has seen a particular surge of activity in the last few years. It provides an overview of some fundamental ideas and techniques, and enough context to make it possible for students with at least a basic knowledge of computability theory and proof theory to appreciate the exciting advances currently happening in the area, and perhaps make contributions of their own. It adopts a case-study approach, using the study of versions of Ramsey's Theorem (for colorings of tuples of natural numbers) and related principles as illustrations of various aspects of computability theoretic and reverse mathematical analysis. This book contains many exercises and open questions.
Автор: Korte, Bernhard, Vygen, Jens Название: Combinatorial Optimization (algorithms and Combinatorics 21) 5th ed. ISBN: 3642244874 ISBN-13(EAN): 9783642244872 Издательство: Springer Рейтинг: Цена: 60510.00 T Наличие на складе: Невозможна поставка. Описание: This comprehensive textbook on combinatorial optimization places special emphasis on theoretical results and algorithms with provably good performance, in contrast to heuristics. It is based on numerous courses on combinatorial optimization and specialized topics, mostly at graduate level. This book reviews the fundamentals, covers the classical topics (paths, flows, matching, matroids, NP-completeness, approximation algorithms) in detail, and proceeds to advanced and recent topics, some of which have not appeared in a textbook before. Throughout, it contains complete but concise proofs, and also provides numerous exercises and references. This fifth edition has again been updated, revised, and significantly extended, with more than 60 new exercises and new material on various topics, including Cayley's formula, blocking flows, faster b-matching separation, multidimensional knapsack, multicommodity max-flow min-cut ratio, and sparsest cut. Thus, this book represents the state of the art of combinatorial optimization.
Автор: B.S. Stechkin; V.I. Baranov Название: Extremal Combinatorial Problems and Their Applications ISBN: 0792336313 ISBN-13(EAN): 9780792336310 Издательство: Springer Рейтинг: Цена: 88500.00 T Наличие на складе: Есть у поставщика Поставка под заказ. Описание: Based on both translated Western sources and original Russian material, this book extends the extremal approach to the solution of a large class of problems, including some that were hitherto regarded as exclusively algorithmic, and broadens the choice of theoretical bases for modelling real phenomena in order to solve practical problems.
Автор: R. W. Robinson; G. W. Southern; W. D. Wallis Название: Combinatorial Mathematics VII ISBN: 354010254X ISBN-13(EAN): 9783540102540 Издательство: Springer Рейтинг: Цена: 32560.00 T Наличие на складе: Есть у поставщика Поставка под заказ.
Автор: E. J. Billington; S. Oates-Williams; A. P. Street Название: Combinatorial Mathematics IX ISBN: 354011601X ISBN-13(EAN): 9783540116011 Издательство: Springer Рейтинг: Цена: 41880.00 T Наличие на складе: Есть у поставщика Поставка под заказ.
Автор: K. L. McAvaney Название: Combinatorial Mathematics VIII ISBN: 3540108831 ISBN-13(EAN): 9783540108832 Издательство: Springer Рейтинг: Цена: 32560.00 T Наличие на складе: Есть у поставщика Поставка под заказ.
Автор: Vladimir N. Sachkov , Translated by V. Kolchin Название: Combinatorial Methods in Discrete Mathematics ISBN: 0521455138 ISBN-13(EAN): 9780521455138 Издательство: Cambridge Academ Рейтинг: Цена: 121440.00 T Наличие на складе: Есть у поставщика Поставка под заказ. Описание: A 1996 account of some complex problems of discrete mathematics in a simple and unified form. A distinctive aspect of the book is the large number of asymptotic formulae derived. This is an important book, describing many ideas not previously available in English; the author has taken the chance to update the text and references where appropriate.
Автор: Ilias S. Kotsireas; Eugene V. Zima Название: Advances in Combinatorial Mathematics ISBN: 3642425046 ISBN-13(EAN): 9783642425042 Издательство: Springer Рейтинг: Цена: 135090.00 T Наличие на складе: Есть у поставщика Поставка под заказ. Описание: The Second Waterloo Workshop on Computer Algebra was dedicated to the 70th birthday of combinatorics pioneer Georgy Egorychev. This book of formally-refereed papers submitted after that workshop covers topics closely related to Egorychev`s influential works.
Автор: Gilbert Baumslag Название: Topics in Combinatorial Group Theory ISBN: 3764329211 ISBN-13(EAN): 9783764329211 Издательство: Springer Рейтинг: Цена: 27910.00 T Наличие на складе: Есть у поставщика Поставка под заказ. Описание: Combinatorial group theory is a loosely defined subject, with close connections to topology and logic. The objective of combinatorial group theory is the systematic development of algebraic techniques to settle such questions. This title features notes that deals with many topics in combinatorial group theory.
Автор: D. Jungnickel; K. Vedder Название: Combinatorial Theory ISBN: 354011971X ISBN-13(EAN): 9783540119715 Издательство: Springer Рейтинг: Цена: 32560.00 T Наличие на складе: Есть у поставщика Поставка под заказ.
Автор: Ding-Zhu Du; Panos M. Pardalos Название: Handbook of Combinatorial Optimization ISBN: 0792359240 ISBN-13(EAN): 9780792359241 Издательство: Springer Рейтинг: Цена: 181670.00 T Наличие на складе: Есть у поставщика Поставка под заказ. Описание: Furthermore, combinatorial optimization problems occur in many diverse areas such as linear and integer programming, graph theory, artificial intelligence, and number theory. Many polynomial-time solvable combinatorial optimization problems are special cases of linear programming (e.g.
Автор: Ding-Zhu Du; F. Hsu Название: Combinatorial Network Theory ISBN: 0792337778 ISBN-13(EAN): 9780792337775 Издательство: Springer Рейтинг: Цена: 130430.00 T Наличие на складе: Есть у поставщика Поставка под заказ. Описание: A basic problem for the interconnection of communications media is to design interconnection networks for specific needs. For example, to minimize delay and to maximize reliability, networks are required that have minimum diameter and maximum connectivity under certain conditions. The book provides a solution to this problem.
Казахстан, 010000 г. Астана, проспект Туран 43/5, НП2 (офис 2) ТОО "Логобук" Тел:+7 707 857-29-98 ,+7(7172) 65-23-70 www.logobook.kz