Customer Reviews (7)

Very practical
I have six or seven "analysis of algorithms" type texts and this is a favorite.From time to time when coworkers notice the title on my bookshelf, they give me some grief for it, but I vigorously defend it.It is a very practical text (as opposed to just theory).I have a bookmark in the section on random number generators and like to point out the a reference about one of the methods:X(n+1) = [a * X(n) + b] mod c.He refers to about 150 pages of Knuth's The Art of Computer Programming for an excellent theoretical description as to how a, b, and c should be chosen, but then summarizes in less than a page a "good" way of choosing them that yields results good enough for most uses.

Must Read
I stumbled upon this great book in algorithms called "How to
Solve it by Computer" by Dromey. I came across it when I was
finding material on the classic work by Polya "How to
Solve it" (1957) which is not directly related to Computer Science.

Dromey has applied Polya's work to CS and has even dedicated
his text to him. Although the book is fairly fundamental,
the style is excellent. He starts with the most obvious (not
so good solution) and *incrementally* builds on that
solution till he refines it to the most optimal solution.

The book also discusses relatively advanced materials like dynamic programming and Longest Monotone Subsequence.

The book was written in 1982 when Pascal was prevalent, so
the solutions are in Pascal, but nonetheless its a true
classic !

The BEST book I have in my collection
I bought this book in 1990.I still read it from time to time.I could not have been a successful programmer without this.I would strongly recommend this to anybody who wants to be a programmer.The first ever book you should read.I will save this book for my children, grand children and so on.

A must read book
This book "How to solve it by computer" is a must read book forthose who want to be programmer. Dromeyhe teaches each and every problemin the easy and understanble way.He does't use any particular language tosolve all those problems, he just uses psudo code engish like language. Anypersona who wants to be programmer should first read this book and thenonly start learning Porgramming languages.

A MUST for begineer programmer
This book should be treated as Bible. It starts with very simple examples as swaping two numbers and goes in depth taking you along with it. I have not found anything as good as this in many years. It gives a beginnerprogrammer much needed confidence very soon. It does not use muchprogramming language (It uses pascal syntax...but pascal is almostEnglish). If you are entering into programming field..start with this book.You will never forget "How to Solve it by computers" in yourentire life. This book has no shelf life. You will never need thisagain....but you cannot do it without first time. Computer Algorithmteaching at its VERY BEST! ... Read more

Product Description
Algorithms for Computer Algebra is the firstcomprehensive textbook to be published on the topic of computationalsymbolic mathematics. The book first develops the foundationalmaterial from modern algebra that is required for subsequent topics.It then presents a thorough development of modern computationalalgorithms for such problems as multivariate polynomial arithmetic andgreatest common divisor calculations, factorization of multivariatepolynomials, symbolic solution of linear and polynomial systems ofequations, and analytic integration of elementary functions. Numerousexamples are integrated into the text as an aid to understanding themathematical development. The algorithms developed for each topic arepresented in a Pascal-like computer language. An extensive set ofexercises is presented at the end of each chapter.
Algorithms for Computer Algebra is suitable for use as atextbook for a course on algebraic algorithms at the third-year,fourth-year, or graduate level. Although the mathematical developmentuses concepts from modern algebra, the book is self-contained in thesense that a one-term undergraduate course introducing students torings and fields is the only prerequisite assumed. The book alsoserves well as a supplementary textbook for a traditional modernalgebra course, by presenting concrete applications to motivate theunderstanding of the theory of rings and fields.
... Read more

Customer Reviews (2)

an excellent treatment
We used this book in an advanced undergraduate/early graduate class in computer algebra.The book provides a concise and rigorous, but very readable introduction to computational algebra theory, with algorithms written in pseudo code.

Assuming proficiency in programming, as further pre-requisite I would suggest an undergraduate course in abstract algebra (or equivalent mathematical maturity) for maximum benefit.

An excellent collection of algorithms, proofs, and advanced introductory material, written in a (comparatively) breezy style.

Clear and understandable, but some bugs
I found this book very useful as a reference while writing a smallcomputer algebra system.It's a definate must-have for all the hordes ofpeople out there who are rewriting subsets of Maple, Mathematica, etc.Theexplanation of the theory is relatively clear and helpful so that anot-so-theory-inclined person (such as myself) can understand the material. The cost of such clarity is a loss of some conciseness so someone wholives and breathes abstract algebra may desire a more esoteric book (likeWinkler's). The biggest flaw of the book are the poorly debuggedalgorithms.Almost every algorithm presented in the book has some sort ofminor flaw with serious reprecussions on correctness.This results in muchfrustration if you're actually trying to implement the algorithms. ... Read more

Product Description
This book covers all the traditional topics of discrete mathematics—logic, sets, relations, functions, and graphs—and reflects recent trends in computer science.Shows how to use discrete mathematics and logic for specifying new computer applications, and how to reason about programs in a systematic way. Describes Prolog, a programming language based on logic, and a section on Miranda, language bad on functions. Features numerous examples which relate the mathematical concepts to problems in computer science. ... Read more

Customer Reviews (2)

University Level material
I have used this textbook when delivering a second year University class on this topic and found that the thorough coverage of the topics was appreciated by my students. Even more important to them was the large number of examples that are presented, in detail, throughout the text.

This is a University Level textbook, not a Study Guide, and respects the reader's intellectual maturity by preparing them for subsequent classes. The perception of "density" implies that it is best taken with a liberal dose of classroom instruction - not many students seem to intuitively grasp discrete mathematics and learn the material wholly on their own. I know that I certainly did not when I was an undergrad!

For students who feel that the material is difficult, I always suggest using the library for another point of view. I also recommend the Schaum's Outline for Discrete Mathematics as a companion if the student is having significant difficulty with the concepts.

Obviously, I like the book, so why not a 5? Unfortunately, I don't know of any books that I would grant a 5 - the authors can always do something better :-)

Not for first-time students..
I'm sure this book covers all the stuff that it's meant to and I'm sure that if I was a post-grad in maths this would be a good book to use. However for anyone else this book is way too heavy reading. The authors have made no attempt to keep the material easy to study and understand. The whole book is just a continuous stream of information with the density of a neutron star and where every 5th or so word is a mathematical formula. Then again maybe I'm just biased because I hate the subject matter - I think it's unnecesarily obscure and difficult for a general computer science course.
And look at the price - that's nearly $150 for us Aussies, (although our uni co-op sells it for about A$90) and that doesn't include shipping fees. Don't you hate it the way they jack up the price on these text books because they know that you have to buy it to have any chance of passing the course. ... Read more

Product Description
Possibly the most comprehensive overview of computer graphics as seen in the context of geometric modeling, this two volume work covers implementation and theory in a thorough and systematic fashion. Computer Graphics and Geometric Modeling: Implementation and Algorithms covers the computer graphics part of the field of geometric modeling and includes all the standard computer graphics topics. The first part deals with basic concepts and algorithms and the main steps involved in displaying photorealistic images on a computer. The second part covers curves and surfaces and a number of more advanced geometric modeling topics including intersection algorithms, distance algorithms, polygonizing curves and surfaces, trimmed surfaces, implicit curves and surfaces, offset curves and surfaces, curvature, geodesics, blending etc. The third part touches on some aspects of computational geometry and a few special topics such as interval analysis and finite element methods. The volume includes two companion programs. ... Read more

Product Description
Key Benefit: This book presents a sound mathematical treatment that increases smoothly in sophistication. Key Topics: The book presents utility-grade discrete math tools so that any reader can understand them, use them, and move on to more advanced mathematical topics. Market: A handy reference for computer scientists. ... Read more

Customer Reviews (18)

shameful condition
I ordered this with other books. Some may have been new, some almost certainly weren't. However, in ordering used books I will never order books not claimed to be in somewhat decent condition.This Discrete Math book shocked me. It looks generally beaten up. It's well used and dog-eared. All forgiveable.The front cover has a big corner torn off which is simply 'replaced' with a doubled-up up back-to-back layer of sticky tape folded to the shape the book should be. Throughout the start of the book, chunks of pages are falling out..........If I had known and paid and expected a book like this it would be different - but I most certainly never had a hint of this being what would arrive.

Comparison of the top 3 Discrete Math Texts
I have read "Discrete Mathematics" by Epp, Rosen and Ross which are the three most common discrete math texts that I encounter at university.

Of these three, I would rate Epp's book as my favorite because it has the clearest explanations and is so easy to read that you can't help but feel like you understand all of the content completely.The only failing that Epp's book might have is that it is not as thorough in its coverage of the material as some of the more technical books.I would say that it covers about 90% of the material and leaves out some of the more obscure topics.

Rosen's book would be the most thorough, covering every topic in meticulous detail and offering a jumping point for other texts in cryptography and number theory.Although this book is more complete than Epp's, it is also less readable and requires more effort to get through.Ideally you would use Epp's book to learn the material and then go to Rosen's book for a technical reference.

For those of you who are considering Ross's book, I have one thing to say and that is don't.Although I have read this book and done a lot of the problems in the first 3/4 of the text, this book is neither clear in its explanations like Epp nor is it as complete as Rosen's book.If you are assigned this book for a course, my suggestion would be to buy Epp's book and photocopy the Ross homework problems from a friend's textbook.

Take the advice of someone who has read all three books.If you have to buy just one, then get the Epp book.It is better to understand 90% of the material completely rather than 100% of the material partially.

Very, very poor book
This is one of the worst books I ever purchased for a class (4th edition).The price is ridiculous and entirely undeserved.These authors take simple subjects and make them incomprehensible.The introduction to proofs in chapter 2 is a perfect example.They try to expose the concepts thru chatty dialog and fail miserably.The student is left more confused than before they read the material.Rosen's book is a lot better.

If this book is required for your course..
If this book is required for your course, then it means the publishing company's marketing machine has won over someone powerful in the department under which your course is managed.

It's sick how such a crappy book can "convince" many course coordinators to make it a required textbook.This book is marketed very well like James Stewarts' Calculus books (table props), but it's even worse than what Stewart puts out (hard to imagine!).

Not every scholar should write for students.
I was a student of Mr. Ross's, taking Discrete Math, a few years ago.He's is a very intelligent man and seemed to enjoy teaching.Unfortunately, he was not very good at it.And same goes for this text book of his.His attitude and approach in the classroom and the book's alike might be helpful if the student has already mastered the majority of the covered topics, in which case, this book becomes useless. ... Read more

Product Description
For one-/two- semester, freshman courses in Discrete Mathematics.This carefully organized, very readable text covers every essential topic in discrete mathematics in a logical fashion. Placing each topic in context, it covers concepts associated with discrete mathematical systems that have applications in computer science, engineering, and mathematics. The author introduces more basic concepts at the freshman level than are found in other texts, in a simple, accessible form. Introductory material is balanced with extensive coverage of graphs, trees, recursion, algebra, theory of computing, and combinatorics. Extensive examples throughout the text reinforce concepts. ... Read more

Customer Reviews (2)

It is high on my list of potential textbooks for a course in discrete math
I occasionally teach discrete mathematics at the college level and so I am always trolling in a search for a better textbook. That is the context within which I examined this book. The coverage of the basic topics is exactly the way I prefer in both order and content. The initial chapters are:

*) Truth tables, logic and proofs
*) Set theory
*) Logic, integers and proofs
*) Functions and matrices

I would never use a book that did not cover logic, set theory, relations and functions in that order.
The remaining topics in the order they appear are:

*) Algorithms and recursion
*) Graphs, directed graphs and trees
*) Number theory
*) Counting and probability
*) Algebraic structures
*) Number theory revisited
*) Recursion revisited
*) Counting continued
*) Generating functions
*) Graphs revisited
*) Trees
*) Networks
*) Theory of computation
*) Theory of codes
*) Enumeration of colors
*) Rings, integral domains and fields
*) Group and semigroup characters
*) Applications of number theory

As can be seen from this list, there is much more material here than can be covered in a one-semester course. However, the sections are independent enough that selection can be done. For example, the "revisited" chapters could be skipped. This revisiting means that the depth of coverage is there if you have need of it. A large number of exercises are included at the end of the chapters and solutions to many of them are included.
I do not know if and when I will teach discrete math again. If that situation does arise again, I will give this book strong consideration as the choice of text.

A pretty good book
While the table of contents is very good, too much time is wasted in developing preliminaries. The text should quickly move into the core of the subject, but instead spends 220 pages developing the elementary material. A good reference for teachers of discrete mathematics with emphasis in combinatorics and not in computer science. ... Read more

Product Description
Containing contributions from both theoretical computer scientists and people working in areas where multi-agent architectures are involved (artificial intelligence, artificial life, linguistics, managing complex systems), this book presents both theoretical developments and applications of grammar systems of various types (cooperating distributed grammar systems, eco-grammar). A survey of notions and results in grammar system theory is included.
This book, the first one of its type, is of interest to researchers faced with complex systems which can be approached at a "syntactic" level (as symbol manipulating systems), as a distributed structure, as well as for computer scientists and mathematicians interested in grammar systems theory, who can find here both basic references, recent developments and suggestions for further research and applications. ... Read more

Product Description
This book provides an exhaustive survey of the most recentachievements in the theory and applications of finite fields and inmany related areas such as algebraic number theory, theoreticalcomputer science, coding theory and cryptography. Topics treatedinclude polynomial factorization over finite fields, the finding anddistribution of irreducible primitive and other special polynomials,constructing special bases of extensions of finite fields, curves andexponential sums, and linear recurrent sequences. Besides a generaloverview of the area, its results and methods, it suggests a number ofinteresting research problems of various levels of difficulty. Thevolume concludes with an impressive bibliographical section containingmore than 2300 references.
Audience: This work will be of interest to graduate students andresearchers in field theory and polynomials, number theory, symboliccomputation, symbolic/algebraic manipulation, and coding theory. ... Read more

Product Description

Mathematics Education and Technology-Rethinking the Terrain revisits the important 1985 ICMI Study on the influence of computers and informatics on mathematics and its teaching.  The focus of this book, resulting from the seventeenth Study led by ICMI, is the use of digital technologies in mathematics teaching and learning in countries across the world. Specifically, it focuses on cultural diversity and how this diversity impinges on the use of digital technologies in mathematics teaching and learning. Within this focus, themes such as mathematics and mathematical practices; learning and assessing mathematics with and through digital technologies; teachers and teaching; design of learning environments and curricula; implementation of curricula and classroom practice; access, equity and socio-cultural issues; and connectivity and virtual networks for learning, serve to organize the study and bring it coherence.

Providing a state-of-the-art view of the domain with regards to research, innovating practices and technological development, Mathematics Education and Technology-Rethinking the Terrain is of interest to researchers and all those interested in the role that digital technology plays in mathematics education.

Product Description
Mathematics textbook specifically geared towards the topics most important to computer science, featuring theorems and proofs, as well as sound logic. Topics covered include propositional calculus, predicate calculus, resolution, hoare logic, and temporal logic. Also features a companion Website. Softcover. DLC: Logic, Symbolic and mathematical. ... Read more

Product Description
Theory and theoreticians have played a major role in computer science. Many insights into the nature of efficient computations were gained and theory was crucial for some of the most celebrated engineering triumphs of computer science (e.g., in compiler design, databases, multitask operating systems, to name just a few). Theoretical computer science (TCS) functions as a communication bridge between computer science and other subjects, notably, mathematics, linguistics, biology; it is a champion in developing unconventional models of computation (DNA, quantum). This book collects personal accounts and reflections of fourteen eminent scientists who have dedicated themselves to the craft of TCS. Contributions focus on authors specific interests, experiences, and reminiscences. The emerging picture, which is just one among other possible ones, should be a catalyst for further developments and continuations. Was most interested to learn about the project, which should be a worthwhile one." N.Chomsky, MIT. "The human story of creativity is inspiring and documents a very noble activity - the creation of knowledge in its most beautiful and useful form - the creation of a science. Supplying the technical and intellectual tools to probe some of the most fascinating questions about the nature of thought and intelligence, theoretical computer science is trying to grasp the limits of rational thought, the limits of knowable. This book will contribute to the understanding of the creation of a magnificent science." J.Hartmanis, NSF. "This is obviously an extremely worthwhile project." D.E.Knuth, Stanford University. ... Read more

Product Description
This book illustrates the mathematical concepts that a game developer would need to develop a professional-quality 3D engine. Although the book is geared toward applications in game development, many of the topics appeal to general interests in 3D graphics. It starts at a fairly basic level in areas such as vector geometry and linear algebra, and then progresses to more advanced topics in 3D programming such as illumination and visibility determination. Particular attention is given to derivations of key results, ensuring that the reader is not forced to endure gaps in the theory. The book assumes a working knowledge of trigonometry and calculus, but also includes sections that review the important tools used from these disciplines, such as trigonometric identities, differential equations, and the Taylor series.

Key Features:

* Concentrates on key mathematical topics for programming 3D game engines

* Discusses applications in the context of the OpenGL architecture due to its cross-platform nature and long-standing industry acceptance. Makes references to modern 3D hardware such as GeForce 3 from Nvidia

* Selected topics include Quaternions, Homogeneous Coordinates, Ray Tracing, Bump Mapping, Portal Systems, Polygonal Techniques, Shadows, and Physics

* Includes exercise sets for use as a textbook ... Read more

Customer Reviews (20)

Excellent source of applications for a Calc III class
If you're trying to find examples of 3D vector operations (dot and cross products, especially) that keep the interest of a mixed class of 18-25 year olds, this book is a fantastic source.If you're approaching the topic from the point of view of a programmer, trying to acquire the necessary math, it may be a bit dense.I'm sure many of the examples are now out-of-date, compared to current 3D implementations, but I learned quite a bit, anyway.

good reference for computer graphics math
like others books in charles media , written by someone in the industry , which means value infos will be in the book .
this book is good for someone studied linear algebra I,II + calculs courses and want to see the applied math in computer applications such as games .
i suggest before reading this book , reading a book about linear algebra + gemetry + calculs so as not to lost in that book because this book not for beginners in math .

Excellent
Excellent Book, I am very pleased with it and encourage it to anyone who already has ground knowledge in Trig + Calc.No fluffer in this book, all content and well written.

For a rock-solid understanding of 3D math
This book provides a solid foundation for anyone who wants to develop a good understanding of the math behind computer graphics. The author provides clear and concise explanations of the concepts covered, backs them up with mathematical proofs, and usually discusses how the concepts can be applied in games, often with sample code. Each chapter has accompanying exercises that I recommended working through.

The topics covered include things you would expect like matrices, vectors, transformations, 3D geometry, and lighting, but also includes are topics like collision detection, ray tracing, visibility determination, and techniques such as billboarding and shadows. It concludes with several chapters on physics including fluid simulation, and a few useful appendices covering trig, complex numbers, and Taylor series.

If you're brand new to graphics and game programming and haven't had a math class in a while, then the somewhat textbook-like language may be a little daunting, but otherwise, this book is an excellent resource for those interested in solidifying their knowledge of 3D math.

A Book for The Whole Life
Surely this is the book I was looking for.
Mostly of the 3D games books just presents codes and some few mentions to the maths techniques, without regarding the concepts behind them.
This one presents the Maths we use in 3D game development in such way that it does not bore the reader and yet makes him learn the math basis behind the 3D graphics programming, presenting, yet, some physics notes to implement a physics based engine.
If you just wanna code, certainly this is not the book for you, but if you are a serious developer (and programmer), surely this is the only book you should need. ... Read more

Product Description

This book contains invited and contributed papers on combinatorics, random graphs and networks, algorithms analysis and trees, branching processes, constituting the Proceedings of the 3rd International Colloquium on Mathematics and Computer Science that will be held in Vienna in September 2004. It addresses a large public in applied mathematics, discrete mathematics and computer science, including researchers, teachers, graduate students and engineers. They will find here current questions in Computer Science and the related modern and powerful mathematical methods. The range of applications is very wide and goes beyond Computer Science.

Customer Reviews (1)

I take Computer Science III. I know what I'm talking about
Taking Computer Science III means that you are a 1337 h4xx0r, among the likes of Mike Sandy, who almost shut down the ED server but only managed to slow it down, after SOMEHOW managing to find out the EncyclopediaDramatica.com IP address. By taking computer Science you officially become a Scientologist. Achieving a Level III in Scientology requires OVER 9000 IRL jewgold, and a lifetime experience of taking computer science. ... Read more

Product Description
Essentials of Discrete Mathematics is the ideal text for a one-term discrete mathematics course to serve computer science majors as well students from a wide range of other disciplines. The material is organized around five types of mathematical thinking: logical, relational, recursive, quantitative, and analytical. This presentation results in a coherent outline that steadily builds upon mathematical sophistication. Graphs are introduced early and referred to throughout the text, providing a richer context for examples and applications. Students will encounter algorithms near the end of the text, after they have acquired enough skills and experience to analyze them properly. The final chapter contains in-depth case studies from a variety of fields, including biology, sociology, linguistics, economics, and music. Clear and concise, Essentials of Discrete Mathematics presents a unified and complete picture of discrete math that instructors can move through in a single semester. ... Read more

Product Description
Numerical Modeling in Science and Engineering Myron B. Allen, George F. Pinder, and Ismael Herrera Emphasizing applications, this treatment combines three traditionally distinct disciplines—continuum mechanics, differential equations, and numerical analysis—to provide a unified treatment of numerical modeling of physical systems. Covers basic equations of macroscopic systems, numerical methods, steady state systems, dissipative systems, nondissipative systems, and high order, nonlinear, and coupled systems. 1988 (0 471-80635-8) 418 pp. Mathematical Modeling and Digital Simulation for Engineers and Scientists Second Edition Jon M. Smith Totally updated, this Second Edition reflects the many developments in simulation and computer modeling theory and practice that have occurred over the past decade. It includes a new section on the use of modern numerical methods for generating chaos and simulating random processes, a section on simulator verification, and provides applications of these methods for personal computers. Readers will find a wealth of practical fault detection and isolation techniques for simulator verification, fast functions evaluation techniques, and nested parenthetical forms and Chebyshev economization techniques. 1987 (0 471-08599-5) 430 pp. Numerical Analysis 1987 David F. Griffiths and George Alistair Watson An invaluable guide to the direction of current research in many areas of numerical analysis, this volume will be of great interest to anyone involved in software design, curve and surface fitting, the numerical solution of ordinary, partial, and integro-differential equations, and the real-world application of numerical techniques. 1988 (0 470-21012-5) 300 pp. ... Read more

Customer Reviews (2)

Fantastic book for beginner.
Great book. I strongly recommend it before reading an advanced book on Computer Algebra.

A book with lots of examples, but...
This book covers mainly the elementary topics in the algorithms of computer algebra. The book has a lot of examples which make it much easier to read. However, comparing to existing algorithmic algebra texts, thisbook is not really covering many topics. For example, Grobner Basis is notin the book. ... Read more

Product Description
Many programmers frequently have limited backgrounds in the mathematics and physics needed for game development or other complex applications. Sooner or later, all programmers run into coding issues that will require an understanding of mathematics or physics concepts like collision detection, 3D vectors, transformations, game theory, or basic calculus. This book provides a simple but thorough grounding in the mathematics and physics topics that programmers need to write these algorithms and programs, using a non-language-specific approach. Applications and examples from game programming are included throughout, and exercise sets follow each chapter for additional practice of the techniques. The CD-ROM provides simulations of the mathematical and physical principles discussed in the book along with the source code.

Key Features:• Presents commonly encountered mathematical and physics concepts such as vector motion, collision detection, angular physics, game theory, artificial intelligence, Bezier curves, etc.• Illustrates concepts through a non-language-specific approach, using pseudo-code, that makes the book equally valuable for anyone from C++ programmers to Macromedia™ Flash ActionScript coders• Includes a companion CD-ROM with demo examples of the mathematical and physical principles discussed in the book along with the source code • Create physical simulations, tile-based, and maze games using the concepts discussed in the book• Uses pedagogical devices such as: a glossary of terms, exercise sets, chapter outlines, and chapter summaries to help master the materialON THE CD-ROM The CD-ROM includes a large number of sample files that demonstrate techniques from the chapters • DEMOS: Contains the support files for the MPFP demo program, in a protected format• DOCS: Contains the text files, in html format, of the code samples• FIGURES: Contains all of the figures from the book, organized in folders by chapter• SOURCE: Contains the original Macromedia Director movies used to create the demosSystem Requirements: PC; Windows 95, 98, ME, NT4, 2000, XP; 266 MHz processor with a current hardware accelerated 3D graphics card; 32 MB or more of available RAM; 256-color monitor capable of 800 x 600 resolution; DirectX 5.0 or greater (recommended); Web browser installed; (To edit the demo files: Macromedia Director 8.5.1 or later installed). ... Read more

Customer Reviews (9)

Not Accessible but Comprehensive
According to the introduction of this book it was designed because "increasingly people are coming into programming from backgrounds other than math. Artists and musicians; authors and screenwriters; businesspeople and teachers all find themselves drifting into the "new media" as a useful additional tool to their trade... So this book tries to address these problems directly by going right back to the fundamentals."

Unfortunately, I found that this book failed to be a good resource for people who do not have an strong background in math. It seems to be a good refresher for people who have a strong math background and are looking for a refresher. The reason being the author is not able to explain math concepts using simple language in a way that can be easily understood by the audiences he claims to be trying to serve. As other reviewers have noted, the author also often includes complex equations and transformations with little explanation.

I found that when reading this book I often needed to turn to wikipedia or other online resources to understand the concepts being covered. Those other resources usually provided much clearer explanations of these key concepts - using language, and examples that were easy to understand for people without background in math.

If you have a strong background in math and already understand the lingo used by mathematicians then this book is for you. if you are an artist, writer, musician with little background in math look elsewhere (and let me know if you find a good one).

Little explination
I picked this book after reading lots of reviews.I wanted a book that covered game physics and could help me reconnect to the math I was using on the job.But this book, while covering every topic I was interested in does a very poor job of explaining what is going on.The author often throws out a complex equation with no explanation of the terms and transforms the equation into a seemingly different variation with all new terms and zero effort to tie them together.The code is too agnostic, and not useful for reading or using.I am back at amazon looking for a better book, this one is to simple for someone versed in the math and lacks the explanations needed to help someone get back up to speed on the subjects.If you had never had a college physics course or taken calculus you would not be able to get anything out of this book at all.

Maths made easy
The book covers a lot of topics, all very well explained. The only bad thing is the pseudocode, is very complicated to understand (the author gave strange names to the variables, and is not easy to follow)

Exactly what I needed
I took physics, linear algebra, and calculus when I was in college.

Unfortunately, upon getting my IT job developing business applications, I did not have much use for them and when I became interested in game development, I realized that I had forgotten a great deal of information that I learned while I was in school.

I did have my linear algebra and calculus text book, but I misplaced (or sold) my physics book. I first looked online for quick tutorials, but a lot of tutorials left a lot to be desired.

This book briefly reviews the necessary basics which quickly returned to me and later applies them 2d and 3d scenarios.

I especially like the language agnostic approach the author has taken with the pseudocode in the book. The introduction states that no knowledge is assumed from the reader as each following chapter builds on a previous one. While, so far that statement has held true, I do wonder if a reader with absolutely no knowledge linear algebra, trig, calculus, and physics will fully grasp what the author is saying. Nevertheless, I do not see that as a negative since the book would be prohibitively huge it were anymore detailed.

The glossary is a nice inclusion and so far has been thorough enough to find everything what I was looking for.

I am certainly glad that I lost my physics book. Otherwise, I would not have this fine book.

Very useful resource
I originally purchased this book as reference material for building a 3D physics engine. And while this book certainly had material relevant for doing so, I probably would have appreciated a little more detail on the subject. That's not to say that this isn't a useful book, it certainly is... But it covers a vast range of topics, from 2D (and some 3D) physics to AI path finding.

Overall, while it is an excellent reference, it was not the one-stop source I was hoping it to be, and wound up having to reference other online articles to supplement what I found here.

Still worth buying, and I'm sure it will see a lot of use in the future.
... Read more

Product Description

The central problem considered in this book is the determination of rational parametrizability of an algebraic curve, and, in the positive case, the computation of a good rational parametrization. This amounts to determining the genus of a curve, i.e. its complete singularity structure, computing regular points of the curve in small coordinate fields, and constructing linear systems of curves with prescribed intersection multiplicities. Various optimality criteria for rational parametrizations of algebraic curves are discussed.

This book is mainly intended for graduate students and researchers in constructive algebraic curve geometry.

Product Description
This unique textbook, which is based on courses taught by the author to students in the US, UK and Europe, introduces the geometry, analysis and topology necessary to understand the mathematical framework for computer graphics. The topics covered range from symmetry and tilings to chaos and fractals, and the applications from computational geometry through numerical analysis to geometric modelling. Consequently it will be welcomed by mathematicians, computer scientists and engineers, whether students or professionals. ... Read more

Customer Reviews (2)

not very good
I've read a number of books on computability theory, and this isnt one of the good ones. It makes fluctuating demands on the level of mathematical sophistication required by the reader. Often trivial ideas are belabored, while more subtle and important concepts are glossed over. Even worse, many important theorems are left as poorly expressed exercises, or the reader is invited to hunt down a four-decade-old research paper if he actually wants to learn anything. Exposition is confused, terminology and notation bad, and the proofs arent so hot either. Pretends to be mathematically rigorous but is not, and fails to foster intuitive understanding either. Too rapid and disorganized for the beginner, especially as topics too advanced for the scope of the book are carelessly thrown in. But its also too clumsy and inarticulate to benefit the advanced reader.

I suppose you can probably find in it a handful of special-topics you havent seen in other books. And there are certainly (much) worse computation theory books out there. Instead I would recomend (1)Lewis & Papadimitriou's _Elements of the Theory of Computation_ 1st edition (but be warned many people seem to hate this book, though i'm sure they wouldnt like yasuharas either) and (2) Hartley Rogers' _Theory of Recursive Functions and Effective Computability_ (great great great book)

more information
Here's the contents of the book: (haven't read it yet)
introduction 1
part 1 recursive function theory
ch 1 turing machines 15
1.1 the definition of a turing machine
1.2 some simple problems tm's can do
1.3 some terminology and notation
1.4 the universal turing machine
1.5 the halting problem
1.6 a few remarks about decision problems
1.7 well-known decision problems
1.8 additional exercises
ch 2 semi-thue and thue systems
2.1 instantaneous descriptions of a turing machine
2.2 semi-thue systems
2.3 thue systems
2.4 the post correspondence problem
2.5 some formal grammar ramifications of the thue system
ch 3 enumerations and godel numbering
3.1 enumerations and countable sets
3.2 godel numberings
ch 4 recursive functions
4.1 preliminaries
4.2 definition of primitive recursive functions
4.3 some simple primitive recursive functions
4.4 some useful primitive recursive functions
4.5 total, regular, and partial functions, and unbounded minimization
4.6 recursive and partial recursive functions
4.7 remarks and exercises on 4.7 and 4.43
ch 5 equivalence of recursive and turing-computable functions
5.1 turing computability
5.2 recursive implies turing computable
5.3 turing computable implies recursive
5.4 some results of the equivalence
5.5 the smn theorem, the recursion theorem, and self-reproducing machines
ch 6 inside recursive functions 103
6.1 remarks
6.2 ackermann's function
6.3 an alternative formulation of the recursive functions
6.4 kalmar-elementary functions and the grzegorzyk hierarchy
6.5 the predictably computable functions, or the ritchie hierarchy
6.6 complexity of partial recursive functions
ch 7 recursively enumerable sets 149
7.1 definitions and basic theorems
7.2 the complete set K
7.3 one-one (many-one) reducibilties
ch 8 recursive and recursively enumerable relations 163
8.1 defintions
8.2 the T predicate
8.3 quantifying on recursive and r.e. relations
8.4 turing reducibility, or oracles
8.5 friedbergs theorem

part 2 mathematical logic
ch 9 the propositional calculus as an example of a recursively
axiomatizable theory 185
9.1 defn of a recursively axiomatizable theory
9.2 a formulation of the propositioinal calculus
9.3 some theorems in P_0 and the deduction theorem
9.4 more about propositional languages; truth values
9.5 tautologies and the consistency of P_0
9.6 truth value functions
9.7 completeness and solvability of P_0
ch 10 introduction to first order languages and relational systems 199
10.1 first order languages
10.2 relational systems
10.3 a relational system for a language
10.4 a formula is true in a relational system
10.5 further discussion of a language and its relational system
10.6 universally valid formulas
10.7 definition of and introduction to first order theories
ch 11 first order theories with equality 223
11.1 the axioms for V
11.2 adding extra names of constants
11.3 V=_ the completeness theorem
11.4 some immediate consequences of the completeness theorem
ch 12 first order theories with equality 236
ch 13 herbrands theorem 242
13.1 prenex normal form
13.2 conjunctive and disjunctive normal forms
13.3 skolem functions
13.4 trees and konigs lemma
13.5 herbrands theorem
13.6 mechanical theorem proving
ch 14 decidable and undecidable theoreis 267
14.1 number theory and peanos axioms
14.2 the incompleteness theorem
14.3 the undecidability of P and N
14.4 two subtheories of N: R and Q

14.5 presburgers theory of addition of natural numbers; elimination of quantifiers
14.6 finite automata and the weak monadic second order theory of successor
14.7 concluding remarks

references 321
index 327 ... Read more

Product Description
This is a concise, up-to-date introduction to extremal combinatorics for non-specialists. Strong emphasis is made on theorems with particularly elegant and informative proofs which may be called the gems of the theory. A wide spectrum of the most powerful combinatorial tools is presented, including methods of extremal set theory, the linear algebra method, the probabilistic method and fragments of Ramsey theory. A thorough discussion of recent applications to computer science illustrates the inherent usefulness of these methods. ... Read more