Complexity of Lattice Problems, Daniele Micciancio; Shafi Goldwasser
Автор: Landsberg JM Название: Geometry and Complexity Theory ISBN: 1107199239 ISBN-13(EAN): 9781107199231 Издательство: Cambridge Academ Рейтинг: Цена: 9662.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: A comprehensive introduction to algebraic geometry and representation theory written by a leading expert in the field. For graduate students and researchers in computer science and mathematics, the book demonstrates state-of-the-art techniques to solve real world problems, focusing on P vs NP and the complexity of matrix multiplication.
Описание: A computational perspective on partial order and lattice theory, focusing on algorithms and their applications This book provides a uniform treatment of the theory and applications of lattice theory.
Автор: Sen, Dr. Soumya Cortesi, Agostino Chaki, Nabendu Название: Hyper-lattice algebraic model for data warehousing ISBN: 3319280422 ISBN-13(EAN): 9783319280424 Издательство: Springer Рейтинг: Цена: 8489.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: This book presents Hyper-lattice, a new algebraic model for partially ordered sets, and an alternative to lattice. The authors analyze some of the shortcomings of conventional lattice structure and propose a novel algebraic structure in the form of Hyper-lattice to overcome problems with lattice.
Автор: Jin-Gyun Chung; Keshab K. Parhi Название: Pipelined Lattice and Wave Digital Recursive Filters ISBN: 1461285607 ISBN-13(EAN): 9781461285601 Издательство: Springer Рейтинг: Цена: 23757.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: The book then presents approaches to the design of pipelined lattice digital filters for the same four types of structures, followed by pipelining of orthogonal double-rotation digital filters, which eliminate limit cycle problems.
Автор: E. B?rger; G. Hasenjaeger; D. R?dding Название: Logic and Machines: Decision Problems and Complexity ISBN: 3540133313 ISBN-13(EAN): 9783540133315 Издательство: Springer Рейтинг: Цена: 4890.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Автор: 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.
Автор: 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.
Автор: 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.
Автор: 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.
ООО "Логосфера " Тел:+7(495) 980-12-10 www.logobook.ru