Kolmogorov Complexity and Computational Complexity, Osamu Watanabe
Автор: 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.
Автор: Jose L. Balcazar; Josep Diaz; Joaquim Gabarro Название: Structural Complexity I ISBN: 3642792375 ISBN-13(EAN): 9783642792373 Издательство: Springer Рейтинг: Цена: 11173.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: This result was already included in our Volume II, but we feel that due to the basic nature of the result, it belongs to this volume. For the sake of the reader of Volume II, where all references to Volume I follow the old numbering, we have included here a table indicating the new number corresponding to each of the old ones.
Автор: Przemys?aw Broniek Название: Computational Complexity of Solving Equation Systems ISBN: 3319217496 ISBN-13(EAN): 9783319217499 Издательство: Springer Рейтинг: Цена: 6986.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: Since unary algebras admit only type 1, this book focuses on these algebras to tackle the main problem. It discusses several aspects of unary algebras and proves that the Constraint Satisfaction Problem for relational structures is polynomially equivalent to SysTermSat over unary algebras.
Описание: This book covers a broad spectrum of results in logic and set theory relevant to the foundations, as well as, the results in computational complexity and the interdisciplinary area of proof complexity. It presents the ideas behind the theoretical concepts.
Автор: 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.
Автор: 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.
Автор: Thomas Moscibroda; Adele A. Rescigno Название: Structural Information and Communication Complexity ISBN: 3319035770 ISBN-13(EAN): 9783319035772 Издательство: Springer Рейтинг: Цена: 6986.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: The typical areas include distributed computing, communication networks, game theory, parallel computing, social networks, mobile computing (including autonomous robots), peer to peer systems, communication complexity, fault tolerant graph theories and randomized/probabilistic issues in networks.
Автор: J?rgensen; Rog?rio Reis Название: Descriptional Complexity of Formal Systems ISBN: 3642393098 ISBN-13(EAN): 9783642393099 Издательство: Springer Рейтинг: Цена: 6986.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: This book constitutes the refereed proceedings of the 15th International Workshop of Descriptional Complexity of Formal Systems, DCFS 2013, held in London, ON, Canada, in July 2013. size complexity and structural complexity of formal systems; size or structural complexity of formal systems for modeling natural languages;
ООО "Логосфера " Тел:+7(495) 980-12-10 www.logobook.ru
