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

Algorithms and Classification in Combinatorial Group Theory, Gilbert Baumslag; Charles F. III Miller


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

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

Автор: Gilbert Baumslag; Charles F. III Miller
Название:  Algorithms and Classification in Combinatorial Group Theory
ISBN: 9781461397328
Издательство: Springer
Классификация:
ISBN-10: 1461397324
Обложка/Формат: Paperback
Страницы: 232
Вес: 0.34 кг.
Дата издания: 14.12.2011
Серия: Mathematical Sciences Research Institute Publications
Язык: English
Размер: 234 x 156 x 13
Основная тема: Mathematics
Ссылка на Издательство: Link
Рейтинг:
Поставляется из: Германии
Описание: In January 1989 a Workshop on Algorithms, Word Problems and Classi- fication in Combinatorial Group Theory was held at MSRl. This was part of a year-long program on Geometry and Combinatorial Group Theory or- ganised by Adyan, Brown, Gersten and Stallings. The organisers of the workshop were G. Baumslag, F.B. Cannonito and C.F. Miller III. The pa- pers in this volume are an outgrowth of lectures at this conference. The first three papers are concerned with decision problems and the next two with finitely presented simple groups. These are followed by two papers dealing with combinatorial geometry and homology. The remaining papers are about automatic groups and related topics. Some of these papers are, in essence, announcements of new results. The complexity of some of them are such that neither the Editors nor the Reviewers feel that they can take responsibility for vouching for the completeness of the proofs involved. We wish to thank the staff at MSRl for their help in organising the workshop and this volume.


Algorithms in Combinatorial Geometry

Автор: Edelsbrunner Herbert
Название: Algorithms in Combinatorial Geometry
ISBN: 3642648738 ISBN-13(EAN): 9783642648731
Издательство: Springer
Цена: 18161.00 р.
Наличие на складе: Есть у поставщика Поставка под заказ.

Topics in Combinatorial Group Theory

Автор: Gilbert Baumslag
Название: Topics in Combinatorial Group Theory
ISBN: 3764329211 ISBN-13(EAN): 9783764329211
Издательство: Springer
Рейтинг:
Цена: 4186.00 р.
Наличие на складе: Есть у поставщика Поставка под заказ.

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

Geometric Algorithms and Combinatorial Optimization

Автор: Martin Gr?tschel; Laszlo Lovasz; Alexander Schrijv
Название: Geometric Algorithms and Combinatorial Optimization
ISBN: 3642782426 ISBN-13(EAN): 9783642782428
Издательство: Springer
Рейтинг:
Цена: 18167.00 р.
Наличие на складе: Есть у поставщика Поставка под заказ.

Описание: Moreover, despite the success of the interior point methods for the solution of explicitly given linear programs there is still no method known that solves implicitly given linear programs, such as those described in this book, and that is both practically and theoretically efficient.

Combinatorial Algorithms

Автор: M?kinen
Название: Combinatorial Algorithms
ISBN: 3319445421 ISBN-13(EAN): 9783319445427
Издательство: Springer
Рейтинг:
Цена: 9224.00 р.
Наличие на складе: Есть у поставщика Поставка под заказ.

Описание: This book constitutes the proceedings of the 27th International Workshop on Combinatorial Algorithms, IWOCA 2016, held in Helsinki, Finland, in August 2016. The 35 papers presented in this volume were carefully reviewed and selected from 87 submissions. online algorithms; combinatorial algorithms; graph algorithms;

Classification Algorithms for Codes and Designs

Автор: Petteri Kaski; Patric R.J. ?sterg?rd
Название: Classification Algorithms for Codes and Designs
ISBN: 3642432506 ISBN-13(EAN): 9783642432507
Издательство: Springer
Рейтинг:
Цена: 19564.00 р.
Наличие на складе: Есть у поставщика Поставка под заказ.

Описание: A new starting-point and a new method are requisite, to insure a complete [classi?cation of the Steiner triple systems of order 15].

Combinatorial Algorithms

Автор: Zsuzsanna Lipt?k; William F. Smyth
Название: Combinatorial Algorithms
ISBN: 3319295152 ISBN-13(EAN): 9783319295152
Издательство: Springer
Рейтинг:
Цена: 7826.00 р.
Наличие на складе: Есть у поставщика Поставка под заказ.

Описание: This book constitutes the thoroughly refereedpost-workshop proceedings for the 26 International Workshop on combinatorialAlgorithms, IWOCA 2015, held in Verona, Italy, in October 2015. The 29 revised full papers presented were carefullyreviewed and selected from a total of 90 submissions.

Approximation, Randomization and Combinatorial Optimization: Algorithms and Techniques

Автор: Michel Goemans; Klaus Jansen; Jose D.P. Rolim; Luc
Название: Approximation, Randomization and Combinatorial Optimization: Algorithms and Techniques
ISBN: 3540424709 ISBN-13(EAN): 9783540424703
Издательство: Springer
Рейтинг:
Цена: 9781.00 р.
Наличие на складе: Есть у поставщика Поставка под заказ.

Описание: These are the joint refereed proceedings of the 4th International Workshop on Approximation Algorithms for Optimization Problems, APPROX 2001 and of the 5th International Workshop on Randomization and Approximation Techniques in Computer Science, RANDOM 2001.

Combinatorial Algorithms

Автор: Jiri Fiala; Jan Kratochvil; Mirka Miller
Название: Combinatorial Algorithms
ISBN: 3642102166 ISBN-13(EAN): 9783642102165
Издательство: Springer
Рейтинг:
Цена: 12577.00 р.
Наличие на складе: Есть у поставщика Поставка под заказ.

Описание: The topics dealt with are algorithms and data structures, applications, combinatorial enumeration, combinatorial optimization, complexity theory, computational biology, databases, decompositions and combinatorial designs, discrete and computational geometry, including graph drawing, and graph theory and combinatorics.

Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques

Автор: Chandra Chekuri; Klaus Jansen; Jos? D.P. Rolim; Lu
Название: Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques
ISBN: 3540282394 ISBN-13(EAN): 9783540282396
Издательство: Springer
Рейтинг:
Цена: 13974.00 р.
Наличие на складе: Есть у поставщика Поставка под заказ.

Описание: Contains 41 reviewed papers, selected by the two program committees from a total of 101 submissions. Among the issues addressed are design and analysis of approximation algorithms, hardness of approximation, small space and data streaming algorithms, sub-linear time algorithms, embeddings and metric space methods, and more.

Gems of Combinatorial Optimization and Graph Algorithms

Автор: Andreas S. Schulz; Martin Skutella; Sebastian Stil
Название: Gems of Combinatorial Optimization and Graph Algorithms
ISBN: 3319249703 ISBN-13(EAN): 9783319249704
Издательство: Springer
Рейтинг:
Цена: 9781.00 р.
Наличие на складе: Есть у поставщика Поставка под заказ.

Описание: Are you looking for new lectures for your course on algorithms, combinatorial optimization, or algorithmic game theory? This volume is aimed at readers with some familiarity of combinatorial optimization, and appeals to researchers, graduate students, and advanced undergraduate students alike.

Efficient Algorithms for Listing Combinatorial Structures

Автор: Goldberg
Название: Efficient Algorithms for Listing Combinatorial Structures
ISBN: 0521450217 ISBN-13(EAN): 9780521450218
Издательство: Cambridge Academ
Рейтинг:
Цена: 17424.00 р.
Наличие на складе: Есть у поставщика Поставка под заказ.

Описание: First published in 1993, this thesis is concerned with the design of efficient algorithms for listing combinatorial structures. Some related work is also included which compares the listing problem with the difficulty of solving the existence problem, the construction problem, the random sampling problem, and the counting problem.


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