Johnson. It was the first book exclusively on the theory of NP-completeness and computational intractability. The book features an appendix providing a thorough compendium of NP-complete problems (which was updated in later printings of the book). The book is now outdated in some respects as it does not cover more recent development such as the PCP theorem. It is nevertheless still in print and is regarded as a classic: in a 2006 study, the CiteSeer search engine listed the book as the most cited reference in computer science literature.

    Building on the successful top-down approach of previous editions, this fourth edition continues with an early emphasis on application-layer paradigms and application programming interfaces, encouraging a hands-on experience with protocols and networking concepts.

    His investigations shed light on what we can ultimately know about the universe and the very nature of life. In an infectious and enthusiastic narrative, Chaitin delineates the specific intellectual and intuitive steps he took toward the discovery. He takes us to the very frontiers of scientific thinking, and helps us to appreciate the art—and the sheer beauty—in the science of math.

    Emphasis is placed on understanding the crisp mathematical idea behind each algorithm, in a manner that is intuitive and rigorous without being unduly formal. Features include: The use of boxes to strengthen the narrative: pieces that provide historical context, descriptions of how the algorithms are used in practice, and excursions for the mathematically sophisticated.Carefully chosen advanced topics that can be skipped in a standard one-semester course, but can be covered in an advanced algorithms course or in a more leisurely two-semester sequence.An accessible treatment of linear programming introduces students to one of the greatest achievements in algorithms. An optional chapter on the quantum algorithm for factoring provides a unique peephole into this exciting topic. In addition to the text, DasGupta also offers a Solutions Manual, which is available on the Online Learning Center.Algorithms is an outstanding undergraduate text, equally informed by the historical roots and contemporary applications of its subject. Like a captivating novel, it is a joy to read. Tim Roughgarden Stanford University

    Hermann Weyl explores the concept of symmetry beginning with the idea that it represents a harmony of proportions, and gradually departs to examine its more abstract varieties and manifestations--as bilateral, translatory, rotational, ornamental, and crystallographic. Weyl investigates the general abstract mathematical idea underlying all these special forms, using a wealth of illustrations as support. Symmetry is a work of seminal relevance that explores the great variety of applications and importance of symmetry.

    This book discusses Von Neumann's work in areas such as game theory, mathematics, physics, and meteorology which formed the building blocks for the most important discoveries of the century: the modern computer, game theory, and the atom bomb.

    Nobel-Prize-winner Claude Cohen-Tannoudji and his colleagues have written this book to eliminate precisely these difficulties. Fourteen chapters provide a clarity of organization, careful attention to pedagogical details, and a wealth of topics and examples which make this work a textbook as well as a timeless reference, allowing to tailor courses to meet students' specific needs. Each chapter starts with a clear exposition of the problem which is then treated, and logically develops the physical and mathematical concept. These chapters emphasize the underlying principles of the material, undiluted by extensive references to applications and practical examples which are put into complementary sections. The book begins with a qualitative introduction to quantum mechanical ideas using simple optical analogies and continues with a systematic and thorough presentation of the mathematical tools and postulates of quantum mechanics as well as a discussion of their physical content. Applications follow, starting with the simplest ones like e.g. the harmonic oscillator, and becoming gradually more complicated (the hydrogen atom, approximation methods, etc.). The complementary sections each expand this basic knowledge, supplying a wide range of applications and related topics as well as detailed expositions of a large number of special problems and more advanced topics, integrated as an essential portion of the text.

    Beginning with the background and very nature of probability theory, the book then proceeds through sample spaces, combinatorial analysis, fluctuations in coin tossing and random walks, the combination of events, types of distributions, Markov chains, stochastic processes, and more. The book's comprehensive approach provides a complete view of theory along with enlightening examples along the way.

    Praised for providing an engaging balance of thoughtful examples and explanatory discussion, ?best-selling author Walter Savitch explains concepts and techniques in a straightforward style using understandable language and code enhanced by a suite of pedagogical tools.? "Absolute Java "is appropriate for both introductory and intermediate programming courses introducing Java.

    Introduction to Modern Cryptography provides a rigorous yet accessible treatment of modern cryptography, with a focus on formal definitions, precise assumptions, and rigorous proofs.The authors introduce the core principles of modern cryptography, including the modern, computational approach to security that overcomes the limitations of perfect secrecy. An extensive treatment of private-key encryption and message authentication follows. The authors also illustrate design principles for block ciphers, such as the Data Encryption Standard (DES) and the Advanced Encryption Standard (AES), and present provably secure constructions of block ciphers from lower-level primitives. The second half of the book focuses on public-key cryptography, beginning with a self-contained introduction to the number theory needed to understand the RSA, Diffie-Hellman, El Gamal, and other cryptosystems. After exploring public-key encryption and digital signatures, the book concludes with a discussion of the random oracle model and its applications.Serving as a textbook, a reference, or for self-study, Introduction to Modern Cryptography presents the necessary tools to fully understand this fascinating subject.

    Linear algebra is tightly integrated into the text.

    The aim of the book is to enable students to write effective C programs.The book starts with an introduction to programming in general followed by a detailed introduction to C programming. It then delves into a complete analysis of various constructs of C such as decision control and looping statements, functions, arrays, strings, pointers, structure and union, file management, and preprocessor directives. It also provides a separate chapter on linked list detailing the various kinds of linked lists and how they are used to allocate memory dynamically.A highly detailed pedagogical approach is followed throughout the book, which includes plenty of examples, figures, programming tips, keywords, and end-chapter exercises which make this book an ideal resource for students to master and fine-tune the art of writing C programs.

    Reuben Hersh argues the contrary, that mathematics must be understood as a human activity, a social phenomenon, part of human culture, historically evolved, and intelligible only in a social context. Hersh pulls the screen back to reveal mathematics as seen by professionals, debunking many mathematical myths, and demonstrating how the humanist idea of the nature of mathematics more closely resembles how mathematicians actually work. At the heart of his book is a fascinating historical account of the mainstream of philosophy--ranging from Pythagoras, Descartes, and Spinoza, to Bertrand Russell, David Hilbert, and Rudolph Carnap--followed by the mavericks who saw mathematics as a human artifact, including Aristotle, Locke, Hume, Mill, and Lakatos.What is Mathematics, Really? reflects an insider's view of mathematical life, and will be hotly debated by anyone with an interest in mathematics or the philosophy of science.

    Mastering this art will not only make you the most desired developer in the market, but it will transform the craziest deadline into "Consider it done, Sir".

    It includes rewritten and clarified proofs and derivations, as well as new topics such as Arnoldi iteration, and domain decomposition methods.