Контакты/Проезд  Доставка и Оплата Помощь/Возврат
История
  +7 707 857-29-98
  +7(7172) 65-23-70
  10:00-18:00 пн-пт
  shop@logobook.kz
   
    Поиск книг                        
Найти
  Зарубежные издательства Российские издательства  
Авторы | Каталог книг | Издательства | Новинки | Учебная литература | Акции | Бестселлеры | |
 

Mathematics and computation /, Wigderson, Avi.


Варианты приобретения
Цена: 47520.00T
Кол-во:
Наличие: Поставка под заказ.  Есть в наличии на складе поставщика.
Склад Англия: 2 шт.  Склад Америка: 141 шт.  
При оформлении заказа до: 2025-08-04
Ориентировочная дата поставки: Август-начало Сентября

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

Автор: Wigderson, Avi.   (Ави Вигдерсон)
Название:  Mathematics and computation /
Перевод названия: Ави Вигдерсон: Математика и вычисления
ISBN: 9780691189130
Издательство: Wiley
Классификация:


ISBN-10: 0691189137
Обложка/Формат: Hardcover
Страницы: 488
Вес: 0.93 кг.
Дата издания: 13.08.2019
Язык: English
Иллюстрации: 25 b/w illus.
Размер: 185 x 260 x 32
Читательская аудитория: Tertiary education (us: college)
Подзаголовок: A theory revolutionizing technology and science
Ссылка на Издательство: Link
Рейтинг:
Поставляется из: Англии
Описание:

An introduction to computational complexity theory, its connections and interactions with mathematics, and its central role in the natural and social sciences, technology, and philosophy

Mathematics and Computation provides a broad, conceptual overview of computational complexity theory--the mathematical study of efficient computation. With important practical applications to computer science and industry, computational complexity theory has evolved into a highly interdisciplinary field, with strong links to most mathematical areas and to a growing number of scientific endeavors.

Avi Wigderson takes a sweeping survey of complexity theory, emphasizing the fields insights and challenges. He explains the ideas and motivations leading to key models, notions, and results. In particular, he looks at algorithms and complexity, computations and proofs, randomness and interaction, quantum and arithmetic computation, and cryptography and learning, all as parts of a cohesive whole with numerous cross-influences. Wigderson illustrates the immense breadth of the field, its beauty and richness, and its diverse and growing interactions with other areas of mathematics. He ends with a comprehensive look at the theory of computation, its methodology and aspirations, and the unique and fundamental ways in which it has shaped and will further shape science, technology, and society. For further reading, an extensive bibliography is provided for all topics covered.

Useful for undergraduates in mathematics and computer science as well as researchers and teachers in the field, Mathematics and Computation brings conceptual clarity to a central and dynamic scientific discipline.

- Comprehensive coverage of computational complexity theory

- High-level, intuitive exposition

- Historical accounts of the evolution and motivations of central concepts and models

- A resourceful look at the theorys influence on science, technology, and society

- Extensive bibliography



Lambda Calculus with Types

Автор: Barendregt
Название: Lambda Calculus with Types
ISBN: 0521766141 ISBN-13(EAN): 9780521766142
Издательство: Cambridge Academ
Рейтинг:
Цена: 85530.00 T
Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: Typed lambda calculus is used in functional programming (Haskell, Clean) and proof assistants (Coq, Isabelle, HOL), which are used to design and verify IT products and mathematical proofs. This book reveals unexpected mathematical beauty in three classes of typing: simple types, recursive types and intersection types. Numerous exercises are provided.

Metamathematics of First-Order Arithmetic

Автор: Petr Hajek
Название: Metamathematics of First-Order Arithmetic
ISBN: 1107168414 ISBN-13(EAN): 9781107168411
Издательство: Cambridge Academ
Рейтинг:
Цена: 111620.00 T
Наличие на складе: Есть
Описание: This much-needed monograph on the metamathematics of first-order arithmetic pays particular attention to subsystems (fragments) of Peano arithmetic and gives the reader a deeper understanding of the role of the axiom schema of induction and of the phenomenon of incompleteness.

General Recursion Theory

Автор: Fenstad
Название: General Recursion Theory
ISBN: 1107168163 ISBN-13(EAN): 9781107168169
Издательство: Cambridge Academ
Рейтинг:
Цена: 121440.00 T
Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: This volume presents a unified and coherent account of general recursion theory. The main core of the book gives an account of the general theory of computations, then the author moves on to show how computation theories connect and unify other parts of recursion theory.

Cambridge Texts in Applied Mathematics

Автор: Boissonnat Jean-Daniel
Название: Cambridge Texts in Applied Mathematics
ISBN: 1108410898 ISBN-13(EAN): 9781108410892
Издательство: Cambridge Academ
Рейтинг:
Цена: 40130.00 T
Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: This book offers a rigorous introduction to geometric and topological inference, a rapidly evolving field that intersects computational geometry, applied topology, and data analysis. It can serve as a textbook for graduate students or researchers in mathematics, computer science and engineering interested in a geometric approach to data science.

Acta Numerica 2016

Автор: Iserles
Название: Acta Numerica 2016
ISBN: 1107168058 ISBN-13(EAN): 9781107168053
Издательство: Cambridge Academ
Рейтинг:
Цена: 174240.00 T
Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: Acta Numerica is an annual publication containing invited survey papers by leading researchers in numerical mathematics and scientific computing. The papers present overviews of recent developments in their area and provide state-of-the-art techniques and analysis.

Algebraic Curves and Finite Fields: Cryptography and Other Applications

Автор: Harald Niederreiter, Alina Ostafe, Daniel Panario,
Название: Algebraic Curves and Finite Fields: Cryptography and Other Applications
ISBN: 3110317885 ISBN-13(EAN): 9783110317886
Издательство: Walter de Gruyter
Цена: 173490.00 T
Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: Algebra and number theory have always been counted among the most beautiful and fundamental mathematical areas with deep proofs and elegant results. However, for a long time they were not considered of any substantial importance for real-life applications. This has dramatically changed with the appearance of new topics such as modern cryptography, coding theory, and wireless communication. Nowadays we find applications of algebra and number theory frequently in our daily life. We mention security and error detection for internet banking, check digit systems and the bar code, GPS and radar systems, pricing options at a stock market, and noise suppression on mobile phones as most common examples. This book collects the results of the workshops "Applications of algebraic curves" and "Applications of finite fields" of the RICAM Special Semester 2013. These workshops brought together the most prominent researchers in the area of finite fields and their applications around the world. They address old and new problems on curves and other aspects of finite fields, with emphasis on their diverse applications to many areas of pure and applied mathematics.

Logic Colloquium `90

Автор: Oikkonen
Название: Logic Colloquium `90
ISBN: 110716902X ISBN-13(EAN): 9781107169029
Издательство: Cambridge Academ
Рейтинг:
Цена: 116160.00 T
Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: The proceedings of the Association for Symbolic Logic meeting held in Helsinki, Finland, in July 1990, containing eighteen papers written by leading researchers in logic. Between them they cover all fields of mathematical logic, including model theory, proof theory, recursion theory, and set theory.

Strategic Voting

Автор: Meir Reshef
Название: Strategic Voting
ISBN: 1681733595 ISBN-13(EAN): 9781681733593
Издательство: Mare Nostrum (Eurospan)
Рейтинг:
Цена: 66530.00 T
Наличие на складе: Невозможна поставка.
Описание: Social choice theory deals with aggregating the preferences of multiple individuals regarding several available alternatives, a situation colloquially known as voting.There are many different voting rules in use and even more in the literature, owing to the various considerations such an aggregation method should take into account. The analysis of voting scenarios becomes particularly challenging in the presence of strategic voters, that is, voters that misreport their true preferences in an attempt to obtain a more favorable outcome. In a world that is tightly connected by the Internet, where multiple groups with complex incentives make frequent joint decisions, the interest in strategic voting exceeds the scope of political science and is a focus of research in economics, game theory, sociology, mathematics, and computer science.The book has two parts. The first part asks ""are there voting rules that are truthful?"" in the sense that all voters have an incentive to report their true preferences. The seminal Gibbard-Satterthwaite theorem excludes the existence of such voting rules under certain requirements. From this starting point, we survey both extensions of the theorem and various conditions under which truthful voting is made possible (such as restricted preference domains). We also explore the connections with other problems of mechanism design such as locating a facility that serves multiple users.In the second part, we ask ""what would be the outcome when voters do vote strategically?"" rather than trying to prevent such behavior. We overview various game-theoretic models and equilibrium concepts from the literature, demonstrate how they apply to voting games, and discuss their implications on social welfare.We conclude with a brief survey of empirical and experimental findings that could play a key role in future development of game theoretic voting models.

G?del `96

Автор: H?jek
Название: G?del `96
ISBN: 1107168023 ISBN-13(EAN): 9781107168022
Издательство: Cambridge Academ
Рейтинг:
Цена: 117210.00 T
Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: The proceedings of the conference `Logical Foundations of Mathematics, Computer Science, and Physics - Kurt Goedel`s Legacy`, held in Brno, Czech Republic, on the 90th anniversary of Goedel`s birth. The papers in this volume cover the wide range of topics Goedel`s work touched, and affirm its continuing importance.

Numerical methods for conservation laws

Автор: Hesthaven, Jan S.
Название: Numerical methods for conservation laws
ISBN: 1611975093 ISBN-13(EAN): 9781611975093
Издательство: Mare Nostrum (Eurospan)
Рейтинг:
Цена: 0.00 T
Наличие на складе: Невозможна поставка.
Описание: Conservation laws are the mathematical expression of the principles of conservation and provide effective and accurate predictive models of our physical world. Although intense research activity during the last decades has led to substantial advances in the development of powerful computational methods for conservation laws, their solution remains a challenge and many questions are left open; thus it is an active and fruitful area of research. Numerical Methods for Conservation Laws: From Analysis to Algorithms:offers the first comprehensive introduction to modern computational methods and their analysis for hyperbolic conservation laws, building on intense research activities for more than four decades of development;discusses classic results on monotone and finite difference/finite volume schemes, but emphasizes the successful development of high-order accurate methods for hyperbolic conservation laws;addresses modern concepts of TVD and entropy stability, strongly stable Runge-Kutta schemes, and limiter-based methods before discussing essentially nonoscillatory schemes, discontinuous Galerkin methods, and spectral methods;explores algorithmic aspects of these methods, emphasizing one- and two-dimensional problems and the development and analysis of an extensive range of methods; includes MATLAB software with which all main methods and computational results in the book can be reproduced; anddemonstrates the performance of many methods on a set of benchmark problems to allow direct comparisons.Code and other supplemental material are available online at www.siam.org/books/cs18.

R For College Mathematics and Statistics

Автор: Thomas Pfaff
Название: R For College Mathematics and Statistics
ISBN: 0367196859 ISBN-13(EAN): 9780367196851
Издательство: Taylor&Francis
Рейтинг:
Цена: 93910.00 T
Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: R can be used consistently in the college mathematics classroom. We no longer have to limit ourselves to ``nice`` functions in calculus classes. We can require reports and homework with graphs. We can do simulations and experiments. R can be useful for student projects, for creating graphics for teaching, as well as for scholarly work.

Strategic Voting

Автор: Reshef Meir
Название: Strategic Voting
ISBN: 1681733617 ISBN-13(EAN): 9781681733616
Издательство: Mare Nostrum (Eurospan)
Рейтинг:
Цена: 87780.00 T
Наличие на складе: Невозможна поставка.
Описание: Social choice theory deals with aggregating the preferences of multiple individuals regarding several available alternatives, a situation colloquially known as voting.There are many different voting rules in use and even more in the literature, owing to the various considerations such an aggregation method should take into account. The analysis of voting scenarios becomes particularly challenging in the presence of strategic voters, that is, voters that misreport their true preferences in an attempt to obtain a more favorable outcome. In a world that is tightly connected by the Internet, where multiple groups with complex incentives make frequent joint decisions, the interest in strategic voting exceeds the scope of political science and is a focus of research in economics, game theory, sociology, mathematics, and computer science.The book has two parts. The first part asks ""are there voting rules that are truthful?"" in the sense that all voters have an incentive to report their true preferences. The seminal Gibbard-Satterthwaite theorem excludes the existence of such voting rules under certain requirements. From this starting point, we survey both extensions of the theorem and various conditions under which truthful voting is made possible (such as restricted preference domains). We also explore the connections with other problems of mechanism design such as locating a facility that serves multiple users.In the second part, we ask ""what would be the outcome when voters do vote strategically?"" rather than trying to prevent such behavior. We overview various game-theoretic models and equilibrium concepts from the literature, demonstrate how they apply to voting games, and discuss their implications on social welfare.We conclude with a brief survey of empirical and experimental findings that could play a key role in future development of game theoretic voting models.


Казахстан, 010000 г. Астана, проспект Туран 43/5, НП2 (офис 2)
ТОО "Логобук" Тел:+7 707 857-29-98 ,+7(7172) 65-23-70 www.logobook.kz
Kaspi QR
   В Контакте     В Контакте Мед  Мобильная версия