P, NP, and NP-Completeness: The Basics of Complexity Theory by Oded Goldreich - Cambridge University Press , 2010The main focus of the current book is on the P-vs-NP Question and the theory of NP-completeness. Additional topics that are covered include the treatment of the general notion of a reduction between computational problems.(5038 views)Think Complexity: Complexity Science and Computational Modeling by Allen B. Downey - Green Tea Press , 2012This book is about complexity science, data structures and algorithms, intermediate programming in Python, and the philosophy of science. The book focuses on discrete models, which include graphs, cellular automata, and agent-based models.(5227 views)Parallel Complexity Theory by Ian Parberry - Prentice Hall , 1987The rapid growth of parallel complexity theory has led to a proliferation of parallel machine models. This book presents a unified theory of parallel computation based on a network model. It is the first such synthesis in book form.(5073 views)Measure-Preserving Systems by Karl Petersen - University of North Carolina , 2008These notes provide an introduction to the subject of measure-preserving dynamical systems, discussing the dynamical viewpoint; how and from where measure-preserving systems arise; the construction of measures and invariant measures; etc.(6691 views)Algorithmic Randomness and Complexity by R. G. Downey, D. R. Hirschfeldt - Springer , 2010Computability and complexity theory are two central areas of research in theoretical computer science. This book provides a systematic, technical development of algorithmic randomness and complexity for scientists from diverse fields.(5333 views)Specifying Systems by Leslie Lamport - Addison-Wesley Professional , 2002This book shows how to write unambiguous specifications of complex computer systems. It provides a complete reference manual for the TLA+, the language developed by the author for writing simple and elegant specifications of algorithms and protocols.(9601 views)Computability and Complexity from a Programming Perspective by Neil D. Jones - The MIT Press , 1997The author builds a bridge between computability and complexity theory and other areas of computer science. Jones uses concepts familiar from programming languages to make computability and complexity more accessible to computer scientists.(7284 views)Foundations of Cryptography by Oded Goldreich - Cambridge University Press , 2007The book gives the mathematical underpinnings for cryptography; this includes one-way functions, pseudorandom generators, and zero-knowledge proofs. Throughout, definitions are complete and detailed; proofs are rigorous and given in full.(11194 views)Computational Complexity: A Conceptual Perspective by Oded Goldreich - Cambridge University Press , 2008This book offers a comprehensive perspective to modern topics in complexity theory. It can be used as an introduction as either a textbook or for self-study, or to experts, since it provides expositions of the various sub-areas of complexity theory.(7156 views)From Complexity to Creativity by Ben Goertzel - Plenum Press , 1996This text applies the concepts of complexity science to provide an explanation of all aspects of human creativity. The book describes the model that integrates ideas from computer science, mathematics, neurobiology, philosophy, and psychology.(10466 views)Complexity and Computation by Allen Downey - Green Tea Press , 2011This book is about data structures and algorithms, intermediate programming in Python, complexity science and the philosophy of science. The book covers Graphs, Analysis of algorithms, Scale-free networks, Cellular Automata, Agent-based models, etc.(11322 views)Lecture Notes on Computational Complexity by Luca Trevisan , 2004Notes from a graduate courses on Computational Complexity. The first 15 lectures cover fundamentals, the remaining is advanced material: Hastad's optimal inapproximability results, lower bounds for parity in bounded depth-circuits, and more.(10791 views)Introduction to Computational Complexity by Martin Tompa , 1991Lecture notes for a graduate course on computational complexity taught at the University of Washington. Alternating Turing machines are introduced very early, and deterministic and nondeterministic Turing machines treated as special cases.(5808 views)Introduction to Complexity Theory by Oded Goldreich , 1999Complexity theory is the study of the intrinsic complexity of computational tasks. The book is aimed at exposing the students to the basic results and research directions in the field. The focus was on concepts, complex technical proofs were avoided.(6262 views)Complexity Theory: A Modern Approach by Sanjeev Arora, Boaz Barak - Cambridge University Press , 2008The book provides an introduction to basic complexity classes, lower bounds on resources required to solve tasks on concrete models such as decision trees or circuits, derandomization and pseudorandomness, proof complexity, quantum computing, etc.(12321 views)Complexity Theory by Johan Håstad , 2008This set of notes gives the broad picture of modern complexity theory, defines the basic complexity classes, gives some examples of each complexity class and proves the most standard relations. The author emphasizes the ideas involved in the proofs.(11521 views)Algorithms and Complexity by Herbert S. Wilf - AK Peters, Ltd. , 1994An introductory textbook on the design and analysis of algorithms. Recursive algorithms are illustrated by Quicksort, FFT, and fast matrix multiplications. Algorithms in number theory are discussed with some applications to public key encryption.(13466 views)