+7(495) 980-12-10
  10:00-18:00 пн-сб
    Поиск книг                    Поиск по списку ISBN Расширенный поиск    
  Зарубежные издательства Российские издательства  
  Авторы | Каталог книг | Издательства | Новинки | Учебная литература | Специальные предложения | Бестселлеры
Книги зарубежных издательств на иностранных языках

Книги российских издательств

Представительство в Казахстане
Вход в систему
Регистрация  Забыли?
Ваши заказы
Доставка и Оплата
Заказ по телефону/email
Есть вопрос?
О компании
Политика конфиденциальности
Online Каталоги
Каталог учебной литературы
по английскому языку >>>

Каталог учебной литературы
по английскому языку >>>

Combinatorics and graph theory, Harris, John Hirst, Jeffry L. Mossinghoff, Michael
Combinatorics and graph theory

Автор: Harris, John Hirst, Jeffry L. Mossinghoff, Michael
Название:  Combinatorics and graph theory   (Комбинаторика и теория графов)
Издательство: Springer
Комбинаторика и теория графа

ISBN: 0387797106
ISBN-13(EAN): 9780387797106
ISBN: 0-387-79710-6
ISBN-13(EAN): 978-0-387-79710-6
Обложка/Формат: Hardback
Страницы: 397
Вес: 0.762 кг.
Дата издания: 01.09.2008
Серия: Undergraduate texts in mathematics
Язык: ENG
Издание: 2nd ed. 2008
Иллюстрации: 165 black & white illustrations, 10 black & white tables, 165 black & white line drawings
Размер: 23.62 x 15.75 x 2.29 cm
Читательская аудитория: Undergraduate
Ссылка на Издательство: Link
Поставляется из: Германии
Описание: Covers a wide variety of topics in combinatorics and graph theory. This book includes results and problems that cross subdisciplines, emphasizing relationships between different areas of mathematics. It also includes sections in graph theory on distance, Eulerian trails, and hamiltonian paths.

Добавить в Мои желания

 Варианты приобретения 
  Наличие на складе Кол-во / Цена р.
1 Поставка под заказ.  Есть в наличии на складе поставщика.
Склад Англия: 756шт.  Склад Америка: 144шт.  
При оформлении заказа до:
Ориентировочная дата поставки:
Добавить в корзину

Combinatorial Optimization (algorithms and Combinatorics 21) 5th ed.

Автор: Korte, Bernhard, Vygen, Jens
Название: Combinatorial Optimization (algorithms and Combinatorics 21) 5th ed.
ISBN: 3642244874 ISBN-13(EAN): 9783642244872
Издательство: Springer
Цена: 5358 р.
Наличие на складе: Есть у поставщика Поставка под заказ.

Описание: 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.

в Мои желания
Surveys in Combinatorics 2003

Автор: Edited by C. D. Wensley
Название: Surveys in Combinatorics 2003
ISBN: 0521540127 ISBN-13(EAN): 9780521540124
Издательство: Cambridge Academ
Цена: 5215 р.
Наличие на складе: Нет в наличии.

Описание: The British Combinatorial Conference is held every two years and is a key event for mathematicians worldwide working in combinatorics. In June 2003 the conference was held at the University of Wales, Bangor. The papers contained here are surveys contributed by the invited speakers and are of the high quality that befits the event. There is also a tribute to Bill Tutte who had a long-standing association with the BCC. The papers cover topics currently attracting significant research interest as well as some less traditional areas such as the combinatorics of protecting digital content. They will form an excellent resource for established researchers as well as graduate students who will find much here to inspire future work.

в Мои желания
Discrete Geometry, Combinatorics and Graph Theory

Автор: Jin Akiyama; William Y.C. Chen; Mikio Kano; Xuelia
Название: Discrete Geometry, Combinatorics and Graph Theory
ISBN: 3540706658 ISBN-13(EAN): 9783540706656
Издательство: Springer
Цена: 5774 р.
Наличие на складе: Есть у поставщика Поставка под заказ.

Описание: This book constitutes the thoroughly refereed post-proceedings of the 7th China-Japan Conference on Discrete Geometry, Combinatorics and Graph Theory, CJCDGCGT 2005, held in Tianjin, China, as well as in Xi`an, China, in November 2005. The 30 revised full papers address all current issues in discrete algorithmic geometry, combinatorics and graph theory.

в Мои желания

Автор: Author Unknown
ISBN: 0444823468 ISBN-13(EAN): 9780444823465
Издательство: Elsevier Science
Цена: 17738 р.
Наличие на складе: Поставка под заказ.

Описание: Covering important results and current trends and issues across the spectrum of combinatorics, this volume covers finite sets and relations, matroids, symmetric structures, and combinatorial structures in geometry and number theory.

в Мои желания
Combinatorics, Automata and Number Theory

Автор: Berth?
Название: Combinatorics, Automata and Number Theory
ISBN: 0521515971 ISBN-13(EAN): 9780521515979
Издательство: Cambridge Academ
Цена: 9126 р.
Наличие на складе: Есть у поставщика Поставка под заказ.

Описание: This collaborative volume presents trends arising from the fruitful interaction between the themes of combinatorics on words, automata and formal language theory, and number theory. Presenting several important tools and concepts, the authors also reveal some of the exciting and important relationships that exist between these different fields. Topics include numeration systems, word complexity function, morphic words, Rauzy tilings and substitutive dynamical systems, Bratelli diagrams, frequencies and ergodicity, Diophantine approximation and transcendence, asymptotic properties of digital functions, decidability issues for D0L systems, matrix products and joint spectral radius. Topics are presented in a way that links them to the three main themes, but also extends them to dynamical systems and ergodic theory, fractals, tilings and spectral properties of matrices. Graduate students, research mathematicians and computer scientists working in combinatorics, theory of computation, number theory, symbolic dynamics, fractals, tilings and stringology will find much of interest in this book.

в Мои желания
The Andrews Festschrift / Seventeen Papers on Classical Number Theory and Combinatorics

Автор: Foata Dominique, Han Guo-Niu
Название: The Andrews Festschrift / Seventeen Papers on Classical Number Theory and Combinatorics
ISBN: 3540414916 ISBN-13(EAN): 9783540414919
Издательство: Springer
Цена: 10724 р.
Наличие на складе: Есть у поставщика Поставка под заказ.

Описание: This book contains seventeen contributions made to George Andrews on the occasion of his sixtieth birthday, ranging from classical number theory (the theory of partitions) to classical and algebraic combinatorics. Most of the papers were read at the 42nd session of the SГ©minaire Lotharingien de Combinatoire that took place at Maratea, Basilicata, in August 1998.This volume contains a long memoir on Ramanujan's Unpublished Manuscript and the Tau functions studied with a contemporary eye, together with several papers dealing with the theory of partitions. There is also a description of a maple package to deal with general q-calculus. More subjects on algebraic combinatorics are developed, especially the theory of Kostka polynomials, the ice square model, the combinatorial theory of classical numbers, a new approach to determinant calculus.

в Мои желания
Algebraic Combinatorics / Lectures at a Summer School in Nordfjordeid, Norway, June 2003

Автор: Orlik Peter, Welker Volkmar, Floystad Gunnar
Название: Algebraic Combinatorics / Lectures at a Summer School in Nordfjordeid, Norway, June 2003
ISBN: 3540683755 ISBN-13(EAN): 9783540683759
Издательство: Springer
Цена: 4533 р.
Наличие на складе: Есть у поставщика Поставка под заказ.

Описание: This book is based on two series of lectures given at a summer school on algebraic combinatorics at the Sophus Lie Centre in Nordfjordeid, Norway, in June 2003, one by Peter Orlik on hyperplane arrangements, and the other one by Volkmar Welker on free resolutions. Both topics are essential parts of current research in a variety of mathematical fields, and the present book makes these sophisticated tools available for graduate students.

в Мои желания
Surveys in Combinatorics 2007

Автор: Edited by Anthony Hilton
Название: Surveys in Combinatorics 2007
ISBN: 0521698235 ISBN-13(EAN): 9780521698238
Издательство: Cambridge Academ
Цена: 4843 р.
Наличие на складе: Есть у поставщика Поставка под заказ.

Описание: This volume contains survey articles based on the invited lectures given at the Twenty-first British Combinatorial Conference, held in July 2007 at the University of Reading. This biennial conference is a well-established international event and the articles are of the high quality that befits the event. By its nature this volume provides an up-to-date overview of current research activity in several areas of combinatorics, ranging from graph theory to current applications of combinatorial mathematics, including efficient approximability of NP-hard optimization problems and cryptographic key management. The authors are some of the world's foremost researchers in their fields, and here they summarize existing results, and give a unique preview of work currently being written up. The book provides a valuable survey of the present state of knowledge in combinatorics. It will be useful to research workers and advanced graduate students, primarily in mathematics but also in computer science, statistics and engineering.

в Мои желания
Additive Combinatorics

Автор: Terence Tao
Название: Additive Combinatorics
ISBN: 0521853869 ISBN-13(EAN): 9780521853866
Издательство: Cambridge Academ
Цена: 7171 р.
Наличие на складе: Есть у поставщика Поставка под заказ.

Описание: Additive combinatorics is the theory of counting additive structures in sets. This theory has seen exciting developments and dramatic changes in direction in recent years thanks to its connections with areas such as number theory, ergodic theory and graph theory. This graduate level textbook will allow students and researchers easy entry into this fascinating field. Here, for the first time, the authors bring together in a self-contained and systematic manner the many different tools and ideas that are used in the modern theory, presenting them in an accessible, coherent, and intuitively clear manner, and providing immediate applications to problems in additive combinatorics. The power of these tools is well demonstrated in the presentation of recent advances such as Szemeredi's theorem on arithmetic progressions, the Kakeya conjecture and Erdos distance problems, and the developing field of sum-product estimates. The text is supplemented by a large number of exercises and new results.

в Мои желания
Combinatorics, Geometry and Probability

Автор: Edited by B?la Bollob?s
Название: Combinatorics, Geometry and Probability
ISBN: 0521607663 ISBN-13(EAN): 9780521607667
Издательство: Cambridge Academ
Цена: 4097 р.
Наличие на складе: Есть у поставщика Поставка под заказ.

Описание: Paul Erdos was one of the greatest mathematicians of this century, known the world over for his brilliant ideas and stimulating questions. On the date of his 80th birthday a conference was held in his honour at Trinity College, Cambridge. Many leading combinatorialists attended. Their subsequent contributions are collected here. The areas represented range from set theory and geometry, through graph theory, group theory and combinatorial probability, to randomised algorithms and statistical physics. Erdos himself was able to give a survey of recent progress made on his favourite problems. Consequently this volume, consisting of in-depth studies at the frontier of research, provides a valuable panorama across the breadth of combinatorics as it is today.

в Мои желания
Combinatorics and Probability

Автор: Edited by Graham Brightwell
Название: Combinatorics and Probability
ISBN: 0521872073 ISBN-13(EAN): 9780521872072
Издательство: Cambridge Academ
Цена: 11548 р.
Наличие на складе: Есть у поставщика Поставка под заказ.

Описание: Combinatorics is an area of mathematics involving an impressive breadth of ideas, and it encompasses topics ranging from codes and circuit design to algorithmic complexity and algebraic graph theory. In a highly distinguished career B?la Bollob?s has made, and continues to make, many significant contributions to combinatorics, and this volume reflects the wide range of topics on which his work has had a major influence. It arises from a conference organized to mark his 60th birthday and the thirty-one articles contained here are of the highest calibre. That so many excellent mathematicians have contributed is testament to the very high regard in which B?la Bollob?s is held. Students and researchers across combinatorics and related fields will find that this volume provides a wealth of insight to the state of the art.

в Мои желания
Applied Combinatorics on Words

Автор: M. Lothaire
Название: Applied Combinatorics on Words
ISBN: 0521848024 ISBN-13(EAN): 9780521848022
Издательство: Cambridge Academ
Цена: 9313 р.
Наличие на складе: Есть у поставщика Поставка под заказ.

Описание: A series of important applications of combinatorics on words has emerged with the development of computerized text and string processing. The aim of this volume, the third in a trilogy, is to present a unified treatment of some of the major fields of applications. After an introduction that sets the scene and gathers together the basic facts, there follow chapters in which applications are considered in detail. The areas covered include core algorithms for text processing, natural language processing, speech processing, bioinformatics, and areas of applied mathematics such as combinatorial enumeration and fractal analysis. No special prerequisites are needed, and no familiarity with the application areas or with the material covered by the previous volumes is required. The breadth of application, combined with the inclusion of problems and algorithms and a complete bibliography will make this book ideal for graduate students and professionals in mathematics, computer science, biology and linguistics.

в Мои желания

ООО "Логосфера " Тел:+7(495) 980-12-10 www.logobook.ru
   В Контакте  Мобильная версия : : : : : : : : : : : : : : : : : : : :