Here is an accessible, algorithmically oriented guide to some of the most interesting techniques of complexity theory. The book shows that simple algorithms are at the heart of complexity theory. The book is organized by technique rather than by topic. Each chapter focuses on one technique: what it is, and what results and applications it yields.

Chaos and complexity are the new buzz words in both science and contemporary society. The ideas they represent have enormous implications for the way we understand and engage with the world. Complexity Theory and the Social Sciences introduces students to the central ideas which surround the chaos/complexity theories. It discusses key concepts before using them as a way of investigating the nature of social research. By applying them to such familiar topics as urban studies, education and health, David Byrne allows readers new to the subject to appreciate the contribution which complexity theory can make to social research and to illuminating the crucial social issues of our day.

An insightful view on how to use the power of complexity theory to manage projects more successfully Current management practices require adherence to rigid, global responses unsuitable for addressing the changing needs of most projects. Complexity Theory and Project Management shifts this paradigm to create opportunities for expanding the decision-making process in ways that promote flexibility—and increase effectiveness. It informs readers on the managerial challenges of juggling project requirements, and offers them a clear roadmap on how to revise perspectives and reassess priorities to excel despite having an unpredictable workflow. One of the first books covering the subject of complexity theory for project management, this useful guide: Explains the relationship of complexity theory to virtual project management Supplies techniques, tips, and suggestions for building effective and successful teams in the virtual environment Presents current information about best practices and relevant proactive tools Makes a strong case for including complexity theory in PMI®'s PMBOK® Guide Complexity Theory and Project Management gives a firsthand view on the future of complexity theory as a driving force in the management field, and allows project managers to get a head start in applying its principles immediately to produce more favorable outcomes. (PMI and PMBOK are registered marks of the Project Management Institute, Inc.)

A complete treatment of fundamentals and recent advances in complexity theory Complexity theory studies the inherent difficulties of solving algorithmic problems by digital computers. This comprehensive work discusses the major topics in complexity theory, including fundamental topics as well as recent breakthroughs not previously available in book form. Theory of Computational Complexity offers a thorough presentation of the fundamentals of complexity theory, including NP-completeness theory, the polynomial-time hierarchy, relativization, and the application to cryptography. It also examines the theory of nonuniform computational complexity, including the computational models of decision trees and Boolean circuits, and the notion of polynomial-time isomorphism. The theory of probabilistic complexity, which studies complexity issues related to randomized computation as well as interactive proof systems and probabilistically checkable proofs, is also covered. Extraordinary in both its breadth and depth, this volume: * Provides complete proofs of recent breakthroughs in complexity theory * Presents results in well-defined form with complete proofs and numerous exercises * Includes scores of graphs and figures to clarify difficult material An invaluable resource for researchers as well as an important guide for graduate and advanced undergraduate students, Theory of Computational Complexity is destined to become the standard reference in the field.

This revised and extensively expanded edition of Computability and Complexity Theory comprises essential materials that are core knowledge in the theory of computation. The book is self-contained, with a preliminary chapter describing key mathematical concepts and notations. Subsequent chapters move from the qualitative aspects of classical computability theory to the quantitative aspects of complexity theory. Dedicated chapters on undecidability, NP-completeness, and relative computability focus on the limitations of computability and the distinctions between feasible and intractable. Substantial new content in this edition includes: a chapter on nonuniformity studying Boolean circuits, advice classes and the important result of Karp─Lipton. a chapter studying properties of the fundamental probabilistic complexity classes a study of the alternating Turing machine and uniform circuit classes. an introduction of counting classes, proving the famous results of Valiant and Vazirani and of Toda a thorough treatment of the proof that IP is identical to PSPACE With its accessibility and well-devised organization, this text/reference is an excellent resource and guide for those looking to develop a solid grounding in the theory of computing. Beginning graduates, advanced undergraduates, and professionals involved in theoretical computer science, complexity theory, and computability will find the book an essential and practical learning tool. Topics and features: Concise, focused materials cover the most fundamental concepts and results in the field of modern complexity theory, including the theory of NP-completeness, NP-hardness, the polynomial hierarchy, and complete problems for other complexity classes Contains information that otherwise exists only in research literature and presents it in a unified, simplified manner Provides key mathematical background information, including sections on logic and number theory and algebra Supported by numerous exercises and supplementary problems for reinforcement and self-study purposes

A powerful guide to thinking and managing your way into the new economy. A how to think book for practicing managers.