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

Encyclopedia of Algorithms, Ming-Yang Kao


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

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

Автор: Ming-Yang Kao
Название:  Encyclopedia of Algorithms
ISBN: 9781493928637
Издательство: Springer
Классификация:



ISBN-10: 1493928635
Обложка/Формат: Hardcover
Страницы: 2389
Вес: 6.61 кг.
Дата издания: 14.03.2016
Серия: Encyclopedia of algorithms
Язык: English
Издание: 2nd ed. 2016
Иллюстрации: 116 illustrations, color; 263 illustrations, black and white; l, 2389 p. 379 illus., 116 illus. in color. in 3 volumes, not available separately.
Размер: 260 x 184 x 146
Читательская аудитория: General (us: trade)
Основная тема: Computer Science
Ссылка на Издательство: Link
Рейтинг:
Поставляется из: Германии


Invitation to fixed-parameter algorithms

Автор: Niedermeier, Rolf
Название: Invitation to fixed-parameter algorithms
ISBN: 0198566077 ISBN-13(EAN): 9780198566076
Издательство: Oxford Academ
Рейтинг:
Цена: 21780.00 р.
Наличие на складе: Есть у поставщика Поставка под заказ.

Описание: An application-oriented introduction to the highly topical area of the development and analysis of efficient fixed-parameter algorithms for hard problems. Aimed at graduate and research mathematicians, algorithm designers, and computer scientists, it provides a fresh view on this highly innovative field of algorithmic research.

Applied Algorithms

Автор: Prosenjit Gupta; Christos Zaroliagis
Название: Applied Algorithms
ISBN: 3319041258 ISBN-13(EAN): 9783319041254
Издательство: Springer
Рейтинг:
Цена: 6986.00 р.
Наличие на складе: Есть у поставщика Поставка под заказ.

Описание: This book constitutes the refereed proceedings of the First International Conference on Applied Algorithms, ICAA 2014, held in Kolkata, India, in January 2014.

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.

Encyclopedia of Distances

Автор: Deza
Название: Encyclopedia of Distances
ISBN: 3662528436 ISBN-13(EAN): 9783662528433
Издательство: Springer
Рейтинг:
Цена: 25155.00 р.
Наличие на складе: Есть у поставщика Поставка под заказ.

Описание: This 4-th edition of the leading reference volume on distance metrics is characterized by updated and rewritten sections on some items suggested by experts and readers, as well a general streamlining of content and the addition of essential new topics. Though the structure remains unchanged, the new edition also explores recent advances in the use of distances and metrics for e.g. generalized distances, probability theory, graph theory, coding theory, data analysis.New topics in the purely mathematical sections include e.g. the Vitanyi multiset-metric, algebraic point-conic distance, triangular ratio metric, Rossi-Hamming metric, Taneja distance, spectral semimetric between graphs, channel metrization, and Maryland bridge distance. The multidisciplinary sections have also been supplemented with new topics, including: dynamic time wrapping distance, memory distance, allometry, atmospheric depth, elliptic orbit distance, VLBI distance measurements, the astronomical system of units, and walkability distance.Leaving aside the practical questions that arise during the selection of a ‘good’ distance function, this work focuses on providing the research community with an invaluable comprehensive listing of the main available distances.As well as providing standalone introductions and definitions, the encyclopedia facilitates swift cross-referencing with easily navigable bold-faced textual links to core entries. In addition to distances themselves, the authors have collated numerous fascinating curiosities in their Who’s Who of metrics, including distance-related notions and paradigms that enable applied mathematicians in other sectors to deploy research tools that non-specialists justly view as arcane. In expanding access to these techniques, and in many cases enriching the context of distances themselves, this peerless volume is certain to stimulate fresh research.

Encyclopedia of Operations Research and Management Science

Автор: Saul I. Gass; Carl M. Harris
Название: Encyclopedia of Operations Research and Management Science
ISBN: 1461380588 ISBN-13(EAN): 9781461380580
Издательство: Springer
Рейтинг:
Цена: 12157.00 р.
Наличие на складе: Есть у поставщика Поставка под заказ.

Описание: problem solvers in business, industry, government and and the 1984 article by Harold Lardner that appeared in academia a comprehensive overview of the wide range of Operations Research: "The Origin of Operational Research," ideas, methodologies, and synergistic forces that combine to 32, 2, 465-475.

Parameterized Algorithms

Автор: Marek Cygan; Fedor V. Fomin; ?ukasz Kowalik; Danie
Название: Parameterized Algorithms
ISBN: 3319212745 ISBN-13(EAN): 9783319212746
Издательство: Springer
Рейтинг:
Цена: 9083.00 р.
Наличие на складе: Есть у поставщика Поставка под заказ.

Описание: Part III presents complexity results and lower bounds, giving negative evidence by way of W[1]-hardness, the Exponential Time Hypothesis, and kernelization lower bounds.All the results and concepts are introduced at a level accessible to graduate students and advanced undergraduate students.

Separable Type Representations of Matrices and Fast Algorithms

Автор: Yuli Eidelman; Israel Gohberg; Iulian Haimovici
Название: Separable Type Representations of Matrices and Fast Algorithms
ISBN: 3034806051 ISBN-13(EAN): 9783034806053
Издательство: Springer
Рейтинг:
Цена: 13974.00 р.
Наличие на складе: Есть у поставщика Поставка под заказ.

Описание: Here is a systematic theoretical and computational study of generalizations of separable matrices. Covers quasiseparable and semiseparable representations of matrices and minimal rank completion problems, factorization and inversion fast algorithms and more.


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