Structural Complexity II, Jose L. Balcazar; Josep Diaz; Joaquim Gabarro

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

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

Автор: Jukka Suomela
Название: Structural Information and Communication Complexity
ISBN: 3319483137 ISBN-13(EAN): 9783319483139
Издательство: Springer
Рейтинг:
Цена: 9224.00 р.
Наличие на складе: Есть у поставщика Поставка под заказ.

Описание: This book constitutes the refereed proceedings of the 23rd International Colloquium on Structural Information and Communication Complexity, SIROCCO 2016, held in Helsinki, Finland in July 2016. The 25 full papers presented were carefully reviewed and selected from 50 submissions.

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

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

Автор: Rodney G. Downey; M.R. Fellows
Название: Parameterized Complexity
ISBN: 1461267986 ISBN-13(EAN): 9781461267980
Издательство: Springer
Рейтинг:
Цена: 34937.00 р.
Наличие на складе: Есть у поставщика Поставка под заказ.

Описание: An approach to complexity theory which offers a means of analysing algorithms in terms of their tractability. The authors consider the problem in terms of parameterized languages and taking "k-slices" of the language, thus introducing readers to new classes of algorithms which may be analysed more precisely than was the case until now.

Автор: Osamu Watanabe
Название: Kolmogorov Complexity and Computational Complexity
ISBN: 3642777376 ISBN-13(EAN): 9783642777370
Издательство: Springer
Рейтинг:
Цена: 18167.00 р.
Наличие на складе: Есть у поставщика Поставка под заказ.

Описание: The mathematical theory of computation has given rise to two important ap- proaches to the informal notion of "complexity": Kolmogorov complexity, usu- ally a complexity measure for a single object such as a string, a sequence etc., measures the amount of information necessary to describe the object.

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

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

Автор: Heribert Vollmer
Название: Introduction to Circuit Complexity
ISBN: 3642083986 ISBN-13(EAN): 9783642083983
Издательство: Springer
Рейтинг:
Цена: 11872.00 р.
Наличие на складе: Есть у поставщика Поставка под заказ.

Описание: An advanced textbook giving a broad, modern view of the computational complexity theory of boolean circuits, with extensive references, for theoretical computer scientists and mathematicians.

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

Автор: E. B?rger; G. Hasenjaeger; D. R?dding
Название: Logic and Machines: Decision Problems and Complexity
ISBN: 3540133313 ISBN-13(EAN): 9783540133315
Издательство: Springer
Рейтинг:
Цена: 4890.00 р.
Наличие на складе: Есть у поставщика Поставка под заказ.