Контакты/Проезд  Доставка и Оплата Помощь/Возврат
История
  +7(495) 980-12-10
  пн-пт: 10-18 сб,вс: 11-18
  shop@logobook.ru
   
    Поиск книг                    Поиск по списку ISBN Расширенный поиск    
Найти
  Зарубежные издательства Российские издательства  
Авторы | Каталог книг | Издательства | Новинки | Учебная литература | Акции | Хиты | |
 

Combinatorics on Traces, Volker Diekert


Варианты приобретения
Цена: 8384.00р.
Кол-во:
Наличие: Поставка под заказ.  Есть в наличии на складе поставщика.
Склад Америка: Есть  
При оформлении заказа до: 2025-07-28
Ориентировочная дата поставки: Август-начало Сентября
При условии наличия книги у поставщика.

Добавить в корзину
в Мои желания

Автор: Volker Diekert
Название:  Combinatorics on Traces
ISBN: 9783540530312
Издательство: Springer
Классификация:
ISBN-10: 3540530312
Обложка/Формат: Paperback
Страницы: 174
Вес: 0.27 кг.
Дата издания: 12.09.1990
Серия: Lecture Notes in Computer Science
Язык: English
Размер: 234 x 156 x 10
Основная тема: Computer Science
Ссылка на Издательство: Link
Рейтинг:
Поставляется из: Германии
Описание: Presents a comprehensive study of Mazurkiewicz` trace theory from an algebraic-combinatorial point of view. This theory is recognized as a tool for a rigorous mathematical treatment of concurrent systems.


Analytic Combinatorics

Автор: 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.

Counting: The Art of Enumerative Combinatorics

Автор: 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.

Combinatorics of Coxeter Groups

Автор: 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

Notes on Introductory Combinatorics

Автор: George P?lya; Robert E. Tarjan; Donald R. Woods
Название: Notes on Introductory Combinatorics
ISBN: 0817649522 ISBN-13(EAN): 9780817649524
Издательство: Springer
Рейтинг:
Цена: 8384.00 р.
Наличие на складе: Есть у поставщика Поставка под заказ.

Описание:

"This is a delightful little paperback which presents a day-by-day transcription of a course taught jointly by Polya and Tarjan at Stanford University...One can count on Polya and Tarjan] for new insights and a fresh outlook. Both instructors taught by presenting a succession of examples rather than by presenting a body of theory... The book] is very well suited as supplementary material for any introductory class on combinatorics; as such, it is very highly recommended. Finally, for all of us who like the topic and delight in observing skilled professionals at work, this book is entertaining and, yes, instructive, reading."

--Mathematical Reviews (Review of the original hardcover edition)

"The mathematical community welcomes this book as a final contribution to honour the teacher G. Polya."

--Zentralblatt MATH (Review of the original hardcover edition)

Higher Combinatorics

Автор: M. Aigner
Название: Higher Combinatorics
ISBN: 9027707952 ISBN-13(EAN): 9789027707956
Издательство: Springer
Рейтинг:
Цена: 19564.00 р.
Наличие на складе: Есть у поставщика Поставка под заказ.

Описание: Proceedings of the NATO Advanced Study Institute, Berlin, Germany, September 1-10, 1976

Formal Power Series and Algebraic Combinatorics

Автор: Daniel Krob; Alexander A. Mikhalev; Alexander V. M
Название: Formal Power Series and Algebraic Combinatorics
ISBN: 3540672478 ISBN-13(EAN): 9783540672470
Издательство: Springer
Рейтинг:
Цена: 33401.00 р.
Наличие на складе: Есть у поставщика Поставка под заказ.

Описание: SFCA/FPSAC (Series Formelles et Combinatoire Algebrique/Formal Power Se- ries and Algebraic Combinatorics) is a series of international conferences that are held annually since 1988, alternating between Europe and North America. They usually take place at the end of the academic year, between June and July depending on the local organizing constraints. SFCA/FPSAC has now become one of the most important annual inter- national meetings for the algebraic and bijective combinatorics community. The conference is indeed one of the key international exchange place of ideas between all researchers involved in this emerging exciting area. SFCA/FPSAC'OO is the 12th in the series. It will take place in Moscow (Russia) from June 26 to June 30, 2000. Previous SFCA/FPSAC conferences were organized in Lille (88), Paris (90), Bordeaux (91), Montreal (92), Florence (93), Rutgers (94), Marne-la-Vallee (95), Minneapolis (96), Vienna (97), Toronto (98) and Barcelona (99). SFCA/FPSAC'OO is co-organized by the Center of New Information Tech- nologies (CNIT) of Moscow State University, the Laboratoire d'Informatique AI- gorithmique: Fondements et Applications (LIAFA) of University Paris 7 and the Maison de l'Informatique et des Mathematiques Discretes (MIMD). The SFCA/FPSAC'OO conference covers all main areas of algebraic combi- natorics and bijective combinatorics (including asymptotic analysis, all sorts of enumeration, representation theory of classical groups and classical Lie algebras, symmetric functions, etc). A special stress was also put this year on combinato- rial and computer algebra.

Combinatorics and Computer Science

Автор: Michel M. Deza; Reinhardt Euler; Ioannis Manoussak
Название: Combinatorics and Computer Science
ISBN: 3540615768 ISBN-13(EAN): 9783540615767
Издательство: Springer
Рейтинг:
Цена: 12157.00 р.
Наличие на складе: Есть у поставщика Поставка под заказ.

Описание: This volume comprises a collection of 33 full papers on combinatorics and computer science, selected from 54 papers accepted for presentation at the joint Eighth Franco-Japanese and Fourth Franco-Chinese Conference on Combinatorics in Computer Science, CCS `96.

Computing and Combinatorics

Автор: Jin-Yi Cai; C.K. Wong
Название: Computing and Combinatorics
ISBN: 3540613323 ISBN-13(EAN): 9783540613329
Издательство: Springer
Рейтинг:
Цена: 12157.00 р.
Наличие на складе: Есть у поставщика Поставка под заказ.

Описание: This volume constitutes the proceedings of the Second Annual International Conference on Computing and Combinatorics. The 44 papers, presented in revised version, describe current research results from various areas of theoretical computer science and combinatorics related to computing.

Recent Advances in Algorithms and Combinatorics

Автор: 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

Advanced Combinatorics

Автор: Louis Comtet
Название: Advanced Combinatorics
ISBN: 9401021988 ISBN-13(EAN): 9789401021982
Издательство: Springer
Рейтинг:
Цена: 12157.00 р.
Наличие на складе: Есть у поставщика Поставка под заказ.

Описание: The true beginnings of combinatorial analysis (also called combina- tory analysis) coincide with the beginnings of probability theory in the 17th century. Today, combinatorial analysis is also relevant to problems of existence, estimation and structuration, like all other parts of mathema- tics, but exclusively forjinite sets.

Matrices in Combinatorics and Graph Theory

Автор: 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.

Formal Power Series and Algebraic Combinatorics

Автор: Daniel Krob; Alexander A. Mikhalev; Alexander V. M
Название: Formal Power Series and Algebraic Combinatorics
ISBN: 3642086624 ISBN-13(EAN): 9783642086625
Издательство: Springer
Рейтинг:
Цена: 33401.00 р.
Наличие на складе: Есть у поставщика Поставка под заказ.

Описание: SFCA/FPSAC (Series Formelles et Combinatoire Algebrique/Formal Power Se- ries and Algebraic Combinatorics) is a series of international conferences that are held annually since 1988, alternating between Europe and North America. They usually take place at the end of the academic year, between June and July depending on the local organizing constraints. SFCA/FPSAC has now become one of the most important annual inter- national meetings for the algebraic and bijective combinatorics community. The conference is indeed one of the key international exchange place of ideas between all researchers involved in this emerging exciting area. SFCA/FPSAC'OO is the 12th in the series. It will take place in Moscow (Russia) from June 26 to June 30, 2000. Previous SFCA/FPSAC conferences were organized in Lille (88), Paris (90), Bordeaux (91), Montreal (92), Florence (93), Rutgers (94), Marne-la-Vallee (95), Minneapolis (96), Vienna (97), Toronto (98) and Barcelona (99). SFCA/FPSAC'OO is co-organized by the Center of New Information Tech- nologies (CNIT) of Moscow State University, the Laboratoire d'Informatique AI- gorithmique: Fondements et Applications (LIAFA) of University Paris 7 and the Maison de l'Informatique et des Mathematiques Discretes (MIMD). The SFCA/FPSAC'OO conference covers all main areas of algebraic combi- natorics and bijective combinatorics (including asymptotic analysis, all sorts of enumeration, representation theory of classical groups and classical Lie algebras, symmetric functions, etc). A special stress was also put this year on combinato- rial and computer algebra.


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