Listing 1 - 10 of 2564 | << page >> |
Sort by
|
Choose an application
Choose an application
Choose an application
Choose an application
Choose an application
Choose an application
Choose an application
Choose an application
Choose an application
"Biological systems are extensively studied as interactions forming complex networks. Reconstructing causal knowledge from, and principles of, these networks from noisy and incomplete data is a challenge in the field of systems biology. Based on an online course hosted by the Santa Fe Institute Complexity Explorer, this book introduces the field of Algorithmic Information Dynamics, a model-driven approach to the study and manipulation of dynamical systems . It draws tools from network and systems biology as well as information theory, complexity science and dynamical systems to study natural and artificial phenomena in software space. It consists of a theoretical and methodological framework to guide an exploration and generate computable candidate models able to explain complex phenomena in particular adaptable adaptive systems, making the book valuable for graduate students and researchers in a wide number of fields in science from physics to cell biology to cognitive sciences"--
Choose an application
This beginning graduate textbook describes both recent achievements and classical results of computational complexity theory. Requiring essentially no background apart from mathematical maturity, the book can be used as a reference for self-study for anyone interested in complexity, including physicists, mathematicians, and other scientists, as well as a textbook for a variety of courses and seminars. More than 300 exercises are included with a selected hint set. The book starts with a broad introduction to the field and progresses to advanced results. Contents include: definition of Turing machines and basic time and space complexity classes, probabilistic algorithms, interactive proofs, cryptography, quantum computation, lower bounds for concrete computational models (decision trees, communication complexity, constant depth, algebraic and monotone circuits, proof complexity), average-case complexity and hardness amplification, derandomization and pseudorandom constructions, and the PCP theorem.
Listing 1 - 10 of 2564 | << page >> |
Sort by
|