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

The Complexity Theory Companion, Lane A. Hemaspaandra; Mitsunori Ogihara


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

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

Автор: Lane A. Hemaspaandra; Mitsunori Ogihara
Название:  The Complexity Theory Companion
ISBN: 9783642086847
Издательство: Springer
Классификация:



ISBN-10: 3642086845
Обложка/Формат: Paperback
Страницы: 372
Вес: 0.54 кг.
Дата издания: 15.12.2010
Серия: Texts in Theoretical Computer Science. An EATCS Series
Язык: English
Размер: 234 x 156 x 20
Основная тема: Computer Science
Ссылка на Издательство: Link
Рейтинг:
Поставляется из: Германии
Описание: 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.


Complexity Theory Retrospective

Автор: Alan L. Selman
Название: Complexity Theory Retrospective
ISBN: 0387973508 ISBN-13(EAN): 9780387973500
Издательство: Springer
Рейтинг:
Цена: 23058.00 р.
Наличие на складе: Есть у поставщика Поставка под заказ.

Описание: The field of complexity theory takes its name from this seminal paper and many of the major concepts and issues of complexity theory were introduced by Hartmanis in subsequent work.

Complexity in Information Theory

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

Complexity Theory Retrospective II

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

Описание: A survey of the subject of Complexity Theory. It provides a description of the state of complexity theory, and demonstrates the breadth of techniques and results. It features the papers that run the gamut from sublogarithmic space to exponential time, and from combinatorial techniques to interactive proof systems.

Completeness and Reduction in Algebraic Complexity Theory

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

Computational complexity

Автор: Arora, Sanjeev Barak, Boaz
Название: Computational complexity
ISBN: 0521424267 ISBN-13(EAN): 9780521424264
Издательство: Cambridge Academ
Рейтинг:
Цена: 9029.00 р.
Наличие на складе: Есть у поставщика Поставка под заказ.

Описание: Describes recent achievements and classical results of computational complexity theory, including interactive proofs, PCP, derandomization, and quantum computation. It can be used as a reference, for self-study, or as a beginning graduate textbook. More than 300 exercises are included.

Computability and Complexity Theory

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

Complexity Theory

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


All topics are considered from an algorithmic point of view stressing the implications for algorithm design

Algebraic Complexity 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.

Complexity Theory Retrospective

Автор: Alan L. Selman
Название: Complexity Theory Retrospective
ISBN: 1461287936 ISBN-13(EAN): 9781461287933
Издательство: Springer
Рейтинг:
Цена: 19564.00 р.
Наличие на складе: Есть у поставщика Поставка под заказ.

Описание: The field of complexity theory takes its name from this seminal paper and many of the major concepts and issues of complexity theory were introduced by Hartmanis in subsequent work.

Complexity Theory Retrospective II

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

Computational complexity

Автор: Oded Goldreich
Название: Computational complexity
ISBN: 052188473X ISBN-13(EAN): 9780521884730
Издательство: Cambridge Academ
Рейтинг:
Цена: 11722.00 р.
Наличие на складе: Есть у поставщика Поставка под заказ.

Описание: A conceptual introduction to the study of the intrinsic complexity of computational tasks. It will serve advanced undergraduate and graduate students, either as a textbook or for self-study. It provides explanations of the various sub-areas of complexity theory such as hardness amplification, pseudorandomness, and probabilistic proof systems.

Communication Complexity

Автор: Eyal Kushilevitz
Название: Communication Complexity
ISBN: 052102983X ISBN-13(EAN): 9780521029834
Издательство: Cambridge Academ
Рейтинг:
Цена: 7128.00 р.
Наличие на складе: Есть у поставщика Поставка под заказ.

Описание: This book surveys the mathematical theory of communication complexity, concentrating on the question of how much communication is necessary for any particular computing process. Applications of the theory include computer networks, VLSI circuits and data structures.


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