Book picks similar to
Computing the Continuous Discretely: Integer-Point Enumeration in Polyhedra by Matthias Beck
mathematics
math
library_ca
computation
Computers and Intractability: A Guide to the Theory of NP-Completeness
Michael R. Garey - 1979
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.
Practical Algebra: A Self-Teaching Guide
Peter H. Selby - 1974
Practical Algebra is an easy andfun-to-use workout program that quickly puts you in command of allthe basic concepts and tools of algebra. With the aid of practical, real-life examples and applications, you'll learn: * The basic approach and application of algebra to problemsolving * The number system (in a much broader way than you have known itfrom arithmetic) * Monomials and polynomials; factoring algebraic expressions; howto handle algebraic fractions; exponents, roots, and radicals;linear and fractional equations * Functions and graphs; quadratic equations; inequalities; ratio, proportion, and variation; how to solve word problems, andmore Authors Peter Selby and Steve Slavin emphasize practical algebrathroughout by providing you with techniques for solving problems ina wide range of disciplines--from engineering, biology, chemistry, and the physical sciences, to psychology and even sociology andbusiness administration. Step by step, Practical Algebra shows youhow to solve algebraic problems in each of these areas, then allowsyou to tackle similar problems on your own, at your own pace.Self-tests are provided at the end of each chapter so you canmeasure your mastery.
Elements of Programming
Alexander Stepanov - 2009
And then we wonder why software is notorious for being delivered late and full of bugs, while other engineers routinely deliver finished bridges, automobiles, electrical appliances, etc., on time and with only minor defects. This book sets out to redress this imbalance. Members of my advanced development team at Adobe who took the course based on the same material all benefited greatly from the time invested. It may appear as a highly technical text intended only for computer scientists, but it should be required reading for all practicing software engineers." --Martin Newell, Adobe Fellow"The book contains some of the most beautiful code I have ever seen." --Bjarne Stroustrup, Designer of C++"I am happy to see the content of Alex's course, the development and teaching of which I strongly supported as the CTO of Silicon Graphics, now available to all programmers in this elegant little book." --Forest Baskett, General Partner, New Enterprise Associates"Paul's patience and architectural experience helped to organize Alex's mathematical approach into a tightly-structured edifice--an impressive feat!" --Robert W. Taylor, Founder of Xerox PARC CSL and DEC Systems Research Center Elements of Programming provides a different understanding of programming than is presented elsewhere. Its major premise is that practical programming, like other areas of science and engineering, must be based on a solid mathematical foundation. The book shows that algorithms implemented in a real programming language, such as C++, can operate in the most general mathematical setting. For example, the fast exponentiation algorithm is defined to work with any associative operation. Using abstract algorithms leads to efficient, reliable, secure, and economical software.This is not an easy book. Nor is it a compilation of tips and tricks for incremental improvements in your programming skills. The book's value is more fundamental and, ultimately, more critical for insight into programming. To benefit fully, you will need to work through it from beginning to end, reading the code, proving the lemmas, and doing the exercises. When finished, you will see how the application of the deductive method to your programs assures that your system's software components will work together and behave as they must.The book presents a number of algorithms and requirements for types on which they are defined. The code for these descriptions--also available on the Web--is written in a small subset of C++ meant to be accessible to any experienced programmer. This subset is defined in a special language appendix coauthored by Sean Parent and Bjarne Stroustrup.Whether you are a software developer, or any other professional for whom programming is an important activity, or a committed student, you will come to understand what the book's experienced authors have been teaching and demonstrating for years--that mathematics is good for programming, and that theory is good for practice.
The Math of Life and Death: 7 Mathematical Principles That Shape Our Lives
Kit Yates - 2019
But for those of us who left math behind in high school, the numbers and figures hurled at us as we go about our days can sometimes leave us scratching our heads and feeling as if we’re fumbling through a mathematical minefield. In this eye-opening and extraordinarily accessible book, mathematician Kit Yates illuminates hidden principles that can help us understand and navigate the chaotic and often opaque surfaces of our world. In The Math of Life and Death, Yates takes us on a fascinating tour of everyday situations and grand-scale applications of mathematical concepts, including exponential growth and decay, optimization, statistics and probability, and number systems. Along the way he reveals the mathematical undersides of controversies over DNA testing, medical screening results, and historical events such as the Chernobyl disaster and the Amanda Knox trial. Readers will finish this book with an enlightened perspective on the news, the law, medicine, and history, and will be better equipped to make personal decisions and solve problems with math in mind, whether it’s choosing the shortest checkout line at the grocery store or halting the spread of a deadly disease.
Introduction to the Theory of Computation
Michael Sipser - 1996
Sipser's candid, crystal-clear style allows students at every level to understand and enjoy this field. His innovative "proof idea" sections explain profound concepts in plain English. The new edition incorporates many improvements students and professors have suggested over the years, and offers updated, classroom-tested problem sets at the end of each chapter.
Algebraic Topology
Allen Hatcher - 2001
This introductory text is suitable for use in a course on the subject or for self-study, featuring broad coverage and a readable exposition, with many examples and exercises. The four main chapters present the basics: fundamental group and covering spaces, homology and cohomology, higher homotopy groups, and homotopy theory generally. The author emphasizes the geometric aspects of the subject, which helps students gain intuition. A unique feature is the inclusion of many optional topics not usually part of a first course due to time constraints: Bockstein and transfer homomorphisms, direct and inverse limits, H-spaces and Hopf algebras, the Brown representability theorem, the James reduced product, the Dold-Thom theorem, and Steenrod squares and powers.
The First Six Books of the Elements of Euclid
Oliver Byrne - 1847
Euclid in living color Nearly a century before Mondrian made geometrical red, yellow, and blue lines famous, 19th century mathematician Oliver Byrne employed the color scheme for the figures and diagrams in his most unusual 1847 edition of Euclid's Elements. The author makes it clear in his subtitle that this is a didactic measure intended to distinguish his edition from all others: “The Elements of Euclid in which coloured diagrams and symbols are used instead of letters for the greater ease of learners.” As Surveyor of Her Majesty’s Settlements in the Falkland Islands, Byrne had already published mathematical and engineering works previous to 1847, but never anything like his edition on Euclid. This remarkable example of Victorian printing has been described as one of the oddest and most beautiful books of the 19th century. Each proposition is set in Caslon italic, with a four-line initial, while the rest of the page is a unique riot of red, yellow, and blue. On some pages, letters and numbers only are printed in color, sprinkled over the pages like tiny wild flowers and demanding the most meticulous alignment of the different color plates for printing. Elsewhere, solid squares, triangles, and circles are printed in bright colors, expressing a verve not seen again on the pages of a book until the era of Dufy, Matisse, and Derain.
Bayes' Rule: A Tutorial Introduction to Bayesian Analysis
James V. Stone - 2013
Discovered by an 18th century mathematician and preacher, Bayes' rule is a cornerstone of modern probability theory. In this richly illustrated book, intuitive visual representations of real-world examples are used to show how Bayes' rule is actually a form of commonsense reasoning. The tutorial style of writing, combined with a comprehensive glossary, makes this an ideal primer for novices who wish to gain an intuitive understanding of Bayesian analysis. As an aid to understanding, online computer code (in MatLab, Python and R) reproduces key numerical results and diagrams.Stone's book is renowned for its visually engaging style of presentation, which stems from teaching Bayes' rule to psychology students for over 10 years as a university lecturer.
Chances Are . . .: Adventures in Probability
Michael Kaplan - 2003
All things are possible, only one thing actually happens; everything else is in the realm of probability. The twin disciplines of probability and statistics underpin every modern science and sketch the shape of all purposeful group activity- politics, economics, medicine, law, sports-giving humans a handle on the essential uncertainty of their existence. Yet while we are all aware of the hard facts, most of us still refuse to take account of probability-preferring to drive, not fly; buying into market blips; smoking cigarettes; denying we will ever age. There are some people, though-gamblers, risk buyers, forensic experts, doctors, strategists- who find probability's mass of incomplete uncertainties delightful and revelatory. "Chances Are" is their story. Combining philosophical and historical background with portraits of the men and women who command the forces of probability, this engaging, wide-ranging, and clearly written volume will be welcomed not only by the proven audiences for popular books like "E=MC2" and "The Golden Ratio" but by anyone interested in the workings of fate.
Thinking In Numbers: On Life, Love, Meaning, and Math
Daniel Tammet - 2012
In Tammet's world, numbers are beautiful and mathematics illuminates our lives and minds. Using anecdotes, everyday examples, and ruminations on history, literature, and more, Tammet allows us to share his unique insights and delight in the way numbers, fractions, and equations underpin all our lives. Inspired by the complexity of snowflakes, Anne Boleyn's eleven fingers, or his many siblings, Tammet explores questions such as why time seems to speed up as we age, whether there is such a thing as an average person, and how we can make sense of those we love. Thinking In Numbers will change the way you think about math and fire your imagination to see the world with fresh eyes.
Machine Learning: A Probabilistic Perspective
Kevin P. Murphy - 2012
Machine learning provides these, developing methods that can automatically detect patterns in data and then use the uncovered patterns to predict future data. This textbook offers a comprehensive and self-contained introduction to the field of machine learning, based on a unified, probabilistic approach.The coverage combines breadth and depth, offering necessary background material on such topics as probability, optimization, and linear algebra as well as discussion of recent developments in the field, including conditional random fields, L1 regularization, and deep learning. The book is written in an informal, accessible style, complete with pseudo-code for the most important algorithms. All topics are copiously illustrated with color images and worked examples drawn from such application domains as biology, text processing, computer vision, and robotics. Rather than providing a cookbook of different heuristic methods, the book stresses a principled model-based approach, often using the language of graphical models to specify models in a concise and intuitive way. Almost all the models described have been implemented in a MATLAB software package—PMTK (probabilistic modeling toolkit)—that is freely available online. The book is suitable for upper-level undergraduates with an introductory-level college math background and beginning graduate students.
In Pursuit of the Traveling Salesman: Mathematics at the Limits of Computation
William J. Cook - 2011
In this book, William Cook takes readers on a mathematical excursion, picking up the salesman's trail in the 1800s when Irish mathematician W. R. Hamilton first defined the problem, and venturing to the furthest limits of today's state-of-the-art attempts to solve it. He also explores its many important applications, from genome sequencing and designing computer processors to arranging music and hunting for planets.In Pursuit of the Traveling Salesman travels to the very threshold of our understanding about the nature of complexity, and challenges you yourself to discover the solution to this captivating mathematical problem.
Indiscrete Thoughts
Gian-Carlo Rota - 1996
The era covered by this book, 1950 to 1990, was surely one of the golden ages of science as well as the American university.Cherished myths are debunked along the way as Gian-Carlo Rota takes pleasure in portraying, warts and all, some of the great scientific personalities of the period Stanislav Ulam (who, together with Edward Teller, signed the patent application for the hydrogen bomb), Solomon Lefschetz (Chairman in the 50s of the Princeton mathematics department), William Feller (one of the founders of modern probability theory), Jack Schwartz (one of the founders of computer science), and many others.Rota is not afraid of controversy. Some readers may even consider these essays indiscreet. After the publication of the essay "The Pernicious Influence of Mathematics upon Philosophy" (reprinted six times in five languages) the author was blacklisted in analytical philosophy circles. Indiscrete Thoughts should become an instant classic and the subject of debate for decades to come."Read Indiscrete Thoughts for its account of the way we were and what we have become; for its sensible advice and its exuberant rhetoric."--The Mathematical Intelligencer"Learned, thought-provoking, politically incorrect, delighting in paradox, and likely to offend but everywhere readable and entertaining."--The American Mathematical Monthly"It is about mathematicians, the way they think, and the world in which the live. It is 260 pages of Rota calling it like he sees it... Readers are bound to find his observations amusing if not insightful. Gian-Carlo Rota has written the sort of book that few mathematicians could write. What will appeal immediately to anyone with an interest in research mathematics are the stories he tells about the practice of modern mathematics."--MAA Reviews"
The Golden Ticket: P, Np, and the Search for the Impossible
Lance Fortnow - 2013
Simply stated, it asks whether every problem whose solution can be quickly checked by computer can also be quickly solved by computer. The Golden Ticket provides a nontechnical introduction to P-NP, its rich history, and its algorithmic implications for everything we do with computers and beyond. Lance Fortnow traces the history and development of P-NP, giving examples from a variety of disciplines, including economics, physics, and biology. He explores problems that capture the full difficulty of the P-NP dilemma, from discovering the shortest route through all the rides at Disney World to finding large groups of friends on Facebook. The Golden Ticket explores what we truly can and cannot achieve computationally, describing the benefits and unexpected challenges of this compelling problem.
Computational Complexity
Christos H. Papadimitriou - 1993
It offers a comprehensive and accessible treatment of the theory of algorithms and complexity—the elegant body of concepts and methods developed by computer scientists over the past 30 years for studying the performance and limitations of computer algorithms. The book is self-contained in that it develops all necessary mathematical prerequisites from such diverse fields such as computability, logic, number theory and probability.