Complexity Theory Retrospective, Alan L. Selman

Автор: Yaser S. Abu-Mostafa
Название: Complexity in Information Theory
ISBN: 1461283442 ISBN-13(EAN): 9781461283447
Издательство: Springer
Рейтинг:
Цена: 14673.00 р.
Наличие на складе: Есть у поставщика Поставка под заказ.

Описание: The means and ends of information theory and computational complexity have grown significantly closer over the past decade. The basic assumption of limited computing resources is the premise for cryptography, where the distinction is made between available information and accessible information.

Автор: Lane A. Hemaspaandra; Alan L. Selman
Название: Complexity Theory Retrospective II
ISBN: 1461273196 ISBN-13(EAN): 9781461273196
Издательство: Springer
Рейтинг:
Цена: 6986.00 р.
Наличие на складе: Есть у поставщика Поставка под заказ.

Описание: This volume provides a survey of the subject in the form of a collection of articles written by experts, that together provides a comprehensive guide to research.

Автор: Lane A. Hemaspaandra; Mitsunori Ogihara
Название: The Complexity Theory Companion
ISBN: 3642086845 ISBN-13(EAN): 9783642086847
Издательство: Springer
Рейтинг:
Цена: 10475.00 р.
Наличие на складе: Есть у поставщика Поставка под заказ.

Описание: Invitation Invitation Secret Secret 1 1 Algorithms Algorithms are are at at the the heart heart of of complexity complexity theory. theory. That That is is the the dark dark secret secret of of complexity complexity theory. theory. It It is is recognized recognized by by complex- complex- ity ity theorists, theorists, but but would would be be literally literally incredible incredible to to most most others. others. In In this this book, book, we we hope hope to to make make this this secret secret credible. credible. In In fact, fact, the the real real secret secret is is even even more more dramatic. dramatic. Secret Secret 2 2 Simple Simple algorithms algorithms are are at at the the heart heart of of complexity complexity theory. theory. A A corollary corollary of of Secret Secret 2 2 is is that that every every practitioner practitioner of of computer computer science science or or stu- stu- dent dent of of computer computer science science already already possesses possesses the the ability ability required required to to understand, understand, enjoy, enjoy, and and employ employ complexity complexity theory. theory.

Автор: Peter B?rgisser; T. Lickteig; Michael Clausen; Moh
Название: Algebraic Complexity Theory
ISBN: 3642082289 ISBN-13(EAN): 9783642082283
Издательство: Springer
Рейтинг:
Цена: 13969.00 р.
Наличие на складе: Есть у поставщика Поставка под заказ.

Описание: Among of group these undecidable problems are the halting problem, the word problem theory, the Post correspondence problem, and Hilbert`s tenth problem.

Автор: Peter B?rgisser
Название: Completeness and Reduction in Algebraic Complexity Theory
ISBN: 3642086047 ISBN-13(EAN): 9783642086045
Издательство: Springer
Рейтинг:
Цена: 18860.00 р.
Наличие на складе: Есть у поставщика Поставка под заказ.

Описание: This is a thorough and comprehensive treatment of the theory of NP-completeness in the framework of algebraic complexity theory. Coverage includes Valiant`s algebraic theory of NP-completeness; interrelations with the classical theory as well as the Blum-Shub-Smale model of computation, questions of structural complexity;

Автор: R. Pruim; Ingo Wegener
Название: Complexity Theory
ISBN: 3642059147 ISBN-13(EAN): 9783642059148
Издательство: Springer
Рейтинг:
Цена: 10480.00 р.
Наличие на складе: Есть у поставщика Поставка под заказ.

Описание:

Reflects recent developments in its emphasis on randomized and approximation algorithms and communication models

Автор: Steven Homer; Alan L. Selman
Название: Computability and Complexity Theory
ISBN: 1489989714 ISBN-13(EAN): 9781489989710
Издательство: Springer
Рейтинг:
Цена: 9781.00 р.
Наличие на складе: Есть у поставщика Поставка под заказ.

Описание: This book surveys theoretical computer science, presenting fundamental concepts and results. Updated and revised, the new edition includes two new chapters on nonuniform complexity, circuit complexity and parallel complexity, and randomized complexity.

Автор: Du
Название: Theory of Computational Complexity 2e
ISBN: 1118306082 ISBN-13(EAN): 9781118306086
Издательство: Wiley
Рейтинг:
Цена: 17733.00 р.
Наличие на складе: Есть у поставщика Поставка под заказ.

Описание: Providing the basic theory and methods that are essential for understanding complexity theory, this second edition of Theory of Computational Complexity emphasizes advances in the field of computational complexity, including newly developed algorithms and novel applications to quantum computing.