Algebraic Systems of Equations and Computational Complexity Theory, Z. Wang; S. Xu; T. Gao
Автор: 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.
Автор: 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.
Автор: 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.
Автор: 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.
Автор: M.E. Pohst Название: Computational Algebraic Number Theory ISBN: 3764329130 ISBN-13(EAN): 9783764329136 Издательство: Springer Рейтинг: Цена: 4186.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: Computational algebraic number theory has been attracting broad interest in the last few years due to its potential applications in coding theory and cryptography. This book emphasizes practical algorithms for the computation of integral bases, the unit group and the class group of arbitrary algebraic number fields.
Автор: Henri Cohen Название: A Course in Computational Algebraic Number Theory ISBN: 3642081428 ISBN-13(EAN): 9783642081422 Издательство: Springer Рейтинг: Цена: 9077.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: With the advent of powerful computing tools and numerous advances in math- ematics, computer science and cryptography, algorithmic number theory has become an important subject in its own right. Both external and internal pressures gave a powerful impetus to the development of more powerful al- gorithms. These in turn led to a large number of spectacular breakthroughs. To mention but a few, the LLL algorithm which has a wide range of appli- cations, including real world applications to integer programming, primality testing and factoring algorithms, sub-exponential class group and regulator algorithms, etc ... Several books exist which treat parts of this subject. (It is essentially impossible for an author to keep up with the rapid pace of progress in all areas of this subject.) Each book emphasizes a different area, corresponding to the author's tastes and interests. The most famous, but unfortunately the oldest, is Knuth's Art of Computer Programming, especially Chapter 4. The present book has two goals. First, to give a reasonably comprehensive introductory course in computational number theory. In particular, although we study some subjects in great detail, others are only mentioned, but with suitable pointers to the literature. Hence, we hope that this book can serve as a first course on the subject. A natural sequel would be to study more specialized subjects in the existing literature.
Автор: 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;
Автор: 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.
Автор: Tignol Jean-Pierre Название: Galois` Theory Of Algebraic Equations (Second Edition) ISBN: 9814704695 ISBN-13(EAN): 9789814704694 Издательство: World Scientific Publishing Рейтинг: Цена: 10296.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание:
The book gives a detailed account of the development of the theory of algebraic equations, from its origins in ancient times to its completion by Galois in the nineteenth century. The appropriate parts of works by Cardano, Lagrange, Vandermonde, Gauss, Abel, and Galois are reviewed and placed in their historical perspective, with the aim of conveying to the reader a sense of the way in which the theory of algebraic equations has evolved and has led to such basic mathematical notions as "group" and "field".
A brief discussion of the fundamental theorems of modern Galois theory and complete proofs of the quoted results are provided, and the material is organized in such a way that the more technical details can be skipped by readers who are interested primarily in a broad survey of the theory.
In this second edition, the exposition has been improved throughout and the chapter on Galois has been entirely rewritten to better reflect Galois' highly innovative contributions. The text now follows more closely Galois' memoir, resorting as sparsely as possible to anachronistic modern notions such as field extensions. The emerging picture is a surprisingly elementary approach to the solvability of equations by radicals, and yet is unexpectedly close to some of the most recent methods of Galois theory.
ООО "Логосфера " Тел:+7(495) 980-12-10 www.logobook.ru
