The Leading eBooks Store Online
for your Apple or Android device, Nook, Kobo, PC, Mac, Sony Reader...
Most popular at the top
Computing in Nonlinear Media and Automata Collectivesby Andrew Adamatzky
CRC Press 2001; US$ 159.95Nonlinear media exhibit a variety of spatio-temporal phenomena. Circular waves, spiral waves and self-localized excitations are the most familiar examples. How to use these phenomena to perform useful computations is the main theme of this book. more...
Parameterized Complexity Theoryby Jorg Flum
Springer-Verlag Berlin and Heidelberg GmbH & Co. KG 2006; US$ 119.00Parameterized complexity theory is a branch of computational complexity theory that provides a framework for a refined analysis of hard algorithmic problems. This book provides an introduction to both algorithmic techniques for fixed-parameter tractability and the structural theory of parameterized complexity classes. more...
Computational Complexityby Marius Zimand
Elsevier 2004; US$ 220.00There has been a common perception that computational complexity is a theory of "bad news" because its most typical results assert that various real-world and innocent-looking tasks are infeasible. In fact, "bad news" is a relative term, and, indeed, in some situations (e.g., in cryptography), we want an adversary to not be able to perform a certain task. However, a "bad news" result does not automatically become useful in such a scenario. For this to happen, its hardness features have to be quantitatively evaluated and shown to manifest extensively. The book undertakes a quantitative analysis of some of the major results in complexity that regard either classes of problems or individual concrete problems. The size of some important classes... more...
Complex Systemsby Jean-Philippe Bouchaud; Marc Mézard; Jean Dalibard
Elsevier 2007; US$ 82.95There has been recently some interdisciplinary convergence on a number of precise topics which can be considered as prototypes of complex systems. This convergence is best appreciated at the level of the techniques needed to deal with these systems, which include: 1) A domain of research around a multiple point where statistical physics, information theory, algorithmic computer science, and more theoretical (probabilistic) computer science meet: this covers some aspects of error correcting codes, stochastic optimization algorithms, typical case complexity and phase transitions, constraint satisfaction problems. 2) The study of collective behavior of interacting agents, its impact on understanding some types of economical and financial problems,... more...
Theory of Automata, Formal Languages and Computationby S.P.E. Xavier
New Age International Pvt. Ltd., Publishers 2004; US$ 20.00This book is aimed at providing an introduction to the basic models of computability to the undergraduate students. This book is devoted to Finite Automata and their properties. Pushdown Automata provides a class of models and enables the analysis of context-free languages. Turing Machines have been introduced and the book discusses computability and decidability. A number of problems with solutions have been provided for each chapter. A lot of exercises have been given with hints/answers to most of these tutorial problems. more...
Kolmogorov's Heritage in Mathematicsby Eric Charpentier; Nikolai Nikolski
Springer 2007; US$ 69.95A.N. Kolmogorov (b. Tambov 1903, d. Moscow 1987) was one of the most brilliant mathematicians that the world has ever known. Incredibly deep and creative, he was able to approach each subject with a completely new point of view: in a few magnificent pages, which are models of shrewdness and imagination, and which astounded his contemporaries, he changed drastically the landscape of the subject. Most mathematicians prove what they can, Kolmogorov was of those who prove what they want. For this book several world experts were asked to present one part of the mathematical heritage left to us by Kolmogorov. Each chapter treats one of Kolmogorov's research themes, or a subject that was invented as a consequence of his discoveries. His contributions... more...
Complexity Explainedby Peter Erdi
Springer 2007; US$ 79.95Explains why complex systems research is important in understanding the structure, function and dynamics of complex natural and social phenomena. This book shows how complex collective behavior emerges from the parts of a system, due to the interaction between the system and its environment. more...
Nonlinear Dimensionality Reductionby John A. Lee; Michel Verleysen
Springer 2007; US$ 89.95Methods of dimensionality reduction provide a way to understand and visualize the structure of complex data sets. This book describes the methods to reduce the dimensionality of numerical databases. For each method, the description starts from intuitive ideas, develops the mathematical details, and ends by outlining the algorithmic implementation. more...
Computational Complexityby Oded Goldreich
Cambridge University Press 2008; US$ 63.00A conceptual introduction to modern topics in complexity for advanced undergraduate and graduate students. more...
Hypercomputationby Apostolos Syropoulos
Springer 2007; US$ 79.95Describing hypercomputation, this book covers various attempts at devising conceptual hypermachines and the computational paradigms that may eventually lead to the construction of a hypermachine. It provides an understanding of what computability is, and why the Church-Turing thesis poses an arbitrary limit to what can be actually computed. more...









