Algorithmic Arithmetic, Geometry and Coding Theory
Book Details:
| Publisher: | American Mathematical Society |
| Series: | MIX |
| Author: | Stephane Ballet |
| Edition: | 1 |
| ISBN-10: | 1470414619 |
| ISBN-13: | 9781470414610 |
| Pages: | 306 |
| Published: | Jun 30 2015 |
| Posted: | Jun 08 2017 |
| Language: | English |
| Book format: | |
| Book size: | 2.82 MB |
Book Description:
This volume contains the proceedings of the 14th International Conference on Arithmetic, Geometry, Cryptography, and Coding Theory (AGCT), held June 3-7, 2013, at CIRM, Marseille, France. These international conferences, held every two years, have been a major event in the area of algorithmic and applied arithmetic geometry for more than 20 years. This volume contains 13 original research articles covering geometric error correcting codes, and algorithmic and explicit arithmetic geometry of curves and higher dimensional varieties. Tools used in these articles include classical algebraic geometry of curves, varieties and Jacobians, Suslin homology, Monsky-Washnitzer cohomology, and $L$-functions of modular forms.
Download Link:
Related Books:
Information, Randomness and Incompleteness
Papers on Algorithmic Information Theory
2nd Edition
God not only plays dice in quantum mechanics, but even with the whole numbers! The discovery of randomness in arithmetic is presented in my book Algorithmic Information Theory published by Cambridge University Press. There I show that to decide if an algebraic equation in integers has finitely or infinitely many solutions is in some cases absolutely intractable. I exhibit an infinite series of such arithmetical assertions that are random arithmetical facts, and for which it is essentially the case that the only way to prove them is to assume them as axioms. This extreme form of Gdel incompleteness theorem shows that some arithmetical truths are totally...
Algorithmic Information Theory
Chaitin, the inventor of algorithmic information theory, presents in this book the strongest possible version of Gdel's incompleteness theorem, using an information theoretic approach based on the size of computer programs. One half of the book is concerned with studying the halting probability of a universal computer if its program is chosen by tossing a coin. The other half is concerned with encoding the halting probability as an algebraic equation in integers, a so-called exponential diophantine equation....
Algorithmic Game Theory
In the last few years game theory has had a substantial impact on computer science, especially on Internet- and e-commerce-related issues. More than 40 of the top researchers in this field have written chapters that go from the foundations to the state of the art. Basic chapters on algorithmic methods for equilibria, mechanism design and combinatorial auctions are followed by chapters on incentives and pricing, cost sharing, information markets and cryptography and security. Students, researchers and practitioners alike need to learn more about these fascinating theoretical developments and their widespread practical application....
2007 - 2021 © eBooks-IT.org