Combinatorics and Computer Science, Michel M. Deza; Reinhardt Euler; Ioannis Manoussak
Автор: Flajolet Название: Analytic Combinatorics ISBN: 0521898064 ISBN-13(EAN): 9780521898065 Издательство: Cambridge Academ Рейтинг: Цена: 13306.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: The definitive treatment of analytic combinatorics. This self-contained text covers the mathematics underlying the analysis of discrete structures, with thorough treatment of a large number of applications. Exercises, examples, appendices and notes aid understanding: ideal for individual self-study or for advanced undergraduate or graduate courses.
Автор: H. Crapo; D. Senato Название: Algebraic Combinatorics and Computer Science ISBN: 8847021596 ISBN-13(EAN): 9788847021594 Издательство: Springer Рейтинг: Цена: 13974.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: This book, dedicated to the memory of Gian-Carlo Rota, is the result of a collaborative effort by his friends, students and admirers. The book opens with a heartfelt piece by Henry Crapo in which he meticulously pieces together what Gian-Carlo Rota`s untimely demise has bequeathed to science.
Автор: George E. Martin Название: Counting: The Art of Enumerative Combinatorics ISBN: 1441929150 ISBN-13(EAN): 9781441929150 Издательство: Springer Рейтинг: Цена: 7819.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: Counting: The Art of Enumerative Combinatorics provides an introduction to discrete mathematics that addresses questions that begin, How many ways are there to...For example, How many ways are there to order a collection of 12 ice cream cones if 8 flavors are available? At the end of the book the reader should be able to answer such nontrivial counting questions as, How many ways are there to color the faces of a cube if k colors are available with each face having exactly one color? or How many ways are there to stack n poker chips, each of which can be red, white, blue, or green, such that each red chip is adjacent to at least 1 green chip? Since there are no prerequisites, this book can be used for college courses in combinatorics at the sophomore level for either computer science or mathematics students. The first five chapters have served as the basis for a graduate course for in-service teachers. Chapter 8 introduces graph theory.
Описание: This IMA Volume in Mathematics and its Applications Applications of Combinatorics and Graph Theory to the Biological and Social Sciences is based on the proceedings of a workshop which was an integral part of the 1987-88 IMA program on APPLIED COMBINATORICS.
Описание: The book is a concise, self-contained and up-to-date introduction to extremal combinatorics for non-specialists. Strong emphasis is made on theorems with particularly elegant and informative proofs which may be called gems of the theory. A wide spectrum of most powerful combinatorial tools is presented: methods of extremal set theory, the linear algebra method, the probabilistic method and fragments of Ramsey theory. A throughout discussion of some recent applications to computer science motivates the liveliness and inherent usefulness of these methods to approach problems outside combinatorics. No special combinatorial or algebraic background is assumed. All necessary elements of linear algebra and discrete probability are introduced before their combinatorial applications. Aimed primarily as an introductory text for graduates, it provides also a compact source of modern extremal combinatorics for researchers in computer science and other fields of discrete mathematics.
Автор: Gyula O.H. Katona; Alexander Schrijver; Tam?s Sz?n Название: Fete of Combinatorics and Computer Science ISBN: 3662506424 ISBN-13(EAN): 9783662506424 Издательство: Springer Рейтинг: Цена: 18866.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: Based on the contributions to Laszlo Lovasz`s 60th anniversary, Fete of Combinatorics and Computer Science provides a collection of articles on discrete mathematics and theoretical computer science. Readers will find a discussion of the state-of-the-art in the field.
Автор: Bruce A. Reed; Claudia L. Linhares-Sales Название: Recent Advances in Algorithms and Combinatorics ISBN: 1468492683 ISBN-13(EAN): 9781468492682 Издательство: Springer Рейтинг: Цена: 13974.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: Excellent authors, such as Lovasz, one of the five best combinatorialists in the world; Thematic linking that makes it a coherent collection; Will appeal to a variety of communities, such as mathematics, computer science and operations research
Автор: Rainer Bodendiek; Rudolf Henn Название: Topics in Combinatorics and Graph Theory ISBN: 3642469108 ISBN-13(EAN): 9783642469107 Издательство: Springer Рейтинг: Цена: 13974.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: This book, which grew out of contributions given by about 130 authors in honour to the 70th birthday of Gerhard Ringel, one of the pioneers in graph theory, is meant to serve as a source of open problems, reference and guide to the extensive literature and as stimulant to further research on graph theory and combinatorics.
Автор: Anders Bjorner; Francesco Brenti Название: Combinatorics of Coxeter Groups ISBN: 3642079229 ISBN-13(EAN): 9783642079221 Издательство: Springer Рейтинг: Цена: 10480.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: Includes a rich variety of exercises to accompany the exposition of Coxeter groups Coxeter groups have already been exposited from algebraic and geometric perspectives, but this book will be presenting the combinatorial aspects of Coxeter groups
Описание: These are the proceedings of the conference "Symbolic Computation, Number Theory, Special Functions, Physics and Combinatorics" held at the Department of Mathematics, University of Florida, Gainesville, from November 11 to 13, 1999.
Автор: Martin Charles Golumbic; Irith Ben-Arroyo Hartman Название: Graph Theory, Combinatorics and Algorithms ISBN: 1441937234 ISBN-13(EAN): 9781441937230 Издательство: Springer Рейтинг: Цена: 18167.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: Graph Theory, Combinatorics and Algorithms: Interdisciplinary Applications focuses on discrete mathematics and combinatorial algorithms interacting with real world problems in computer science, operations research, applied mathematics and engineering.
Автор: Bolian Liu; Hong-Jian Lai Название: Matrices in Combinatorics and Graph Theory ISBN: 1441948341 ISBN-13(EAN): 9781441948342 Издательство: Springer Рейтинг: Цена: 23058.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: Combinatorics and Matrix Theory have a symbiotic, or mutually beneficial, relationship. where an attempt was made to give a broad picture of the use of combinatorial ideas in matrix theory and the use of matrix theory in proving theorems which, at least on the surface, are combinatorial in nature.
ООО "Логосфера " Тел:+7(495) 980-12-10 www.logobook.ru
