Algorithmic Randomness and Complexity, Rodney G. Downey; Denis R. Hirschfeldt

Автор: Boissonnat, Jean-daniel Yvinec, Mariette
Название: Algorithmic geometry
ISBN: 0521565294 ISBN-13(EAN): 9780521565295
Издательство: Cambridge Academ
Рейтинг:
Цена: 9346.00 р.
Наличие на складе: Есть у поставщика Поставка под заказ.

Описание: The goals of this book are twofold: first to present a coherent and systematic treatment of the foundations; secondly to present algorithmic solutions to problems that are simple to state but which nevertheless are applicable in practical situations. The prerequisites for using the book are few, which will make it ideal for teaching advanced courses in computational geometry.

Автор: Ingvar Eidhammer
Название: Protein Bioinformatics: An Algorithmic Approach to Sequence and Structure Analysis
ISBN: 0470848391 ISBN-13(EAN): 9780470848395
Издательство: Wiley
Рейтинг:
Цена: 12189.00 р.
Наличие на складе: Есть у поставщика Поставка под заказ.

Описание: This book takes the novel approach to cover both the sequence and structure analysis of proteins in one volume and from an algorithmic perspective. Key features of the book include:* Provides a comprehensive introduction to the analysis of protein sequence and structure analysis.

Автор: Backhouse
Название: Algorithmic Problem Solving
ISBN: 0470684534 ISBN-13(EAN): 9780470684535
Издательство: Wiley
Рейтинг:
Цена: 6962.00 р.
Наличие на складе: Есть у поставщика Поставка под заказ.

Описание: * Novel approach to the mathematics of problem solving, in particular how to do logical calculations. * Many of the problems are well-known from (mathematical) puzzle books. * The solution method in the book is new and more relevant to the true nature of problem solving in the modern IT-dominated world.

Автор: Dieter van Melkebeek
Название: Randomness and Completeness in Computational Complexity
ISBN: 3540414924 ISBN-13(EAN): 9783540414926
Издательство: Springer
Рейтинг:
Цена: 9781.00 р.
Наличие на складе: Есть у поставщика Поставка под заказ.

Описание: This text, based on the author`s competition-winning PhD thesis, studies central issues in computational complexity: the relative power of time, space, and randomness in computing and verification. He presents approaches based on such concepts as density, redundancy, and frequency of occurrence.