Combinatorial Optimization

Book Description

A complete, highly accessible introduction to one of today's most exciting areas of applied mathematics

One of the youngest, most vital areas of applied mathematics, combinatorial optimization integrates techniques from combinatorics, linear programming, and the theory of algorithms. Because of its success in solving difficult problems in areas from telecommunications to VLSI, from product distribution to airline crew scheduling, the field has seen a ground swell of activity over the past decade.

Combinatorial Optimization is an ideal introduction to this mathematical discipline for advanced undergraduates and graduate students of discrete mathematics, computer science, and operations research. Written by a team of recognized experts, the text offers a thorough, highly accessible treatment of both classical concepts and recent results. The topics include:
* Network flow problems
* Optimal matching
* Integrality of polyhedra
* Matroids
* NP-completeness

Featuring logical and consistent exposition, clear explanations of basic and advanced concepts, many real-world examples, and helpful, skill-building exercises, Combinatorial Optimization is certain to become the standard text in the field for many years to come.

Customer Reviews:

A Classic in Combinatorial Optimization.......2003-03-19

Combinaorial Optimization is one of those rare books that is an instant classic. The authors weave a readable fabric of intuition and theory that is unmatched in this exciting discipline. The choice of topics covered begins with two fundamental optimization problems, namely, the minimum spanning tree and shortest path problems. Next, maximum flow and minimum cost flow problems are discussed, followed by matching problems, polyhedral issues arising in combinatorial optimization, and the famous traveling salesman problem. The text concludes with chapters on matroids and NP-Completeness. The exposition on these topics is very well written and the proofs are rigorous. There is a terrific blend of theory, algorithms and applications without overwhelming the reader with computational details. The authors also do a good job of developing an accurate historical perspective of the material, most of which evolved during the time period 1955 to 1995. The book is suitable for an upper-level undergraduate, or a graduate course. The exercises are very well thought out and are at an appropriate level. I have taught undergraduate courses in combinatorial optimization for over 10 years and have always struggled to find an appropriate text. My problem has now been solved.

Elegant one, but not a lot of details........1999-09-30

This book was thoroughly written by great-minded Masters. It is well-organized in their topics and presentation. However, the book details is unbalnced, some chapters are overwhelm the data, and some others are insufficient. By the way, I graded this book a Very Good one. Worth Reading !!

A superb introduction to Combinatorial Optimisation.......1999-07-17

A good introduction to Combinatorial optimisation and integer programming.

Amazon.com

Cryptographic techniques have applications far beyond the obvious uses of encoding and decoding information. For Internet developers who need to know about capabilities, such as digital signatures, that depend on cryptographic techniques, there's no better overview than Applied Cryptography, the definitive book on the subject. Bruce Schneier covers general classes of cryptographic protocols and then specific techniques, detailing the inner workings of real-world cryptographic algorithms including the Data Encryption Standard and RSA public-key cryptosystems. The book includes source-code listings and extensive advice on the practical aspects of cryptography implementation, such as the importance of generating truly random numbers and of keeping keys secure.

Book Description

". . .the best introduction to cryptography I've ever seen. . . . The book the National Security Agency wanted never to be published. . . ." -Wired Magazine

". . .monumental . . . fascinating . . . comprehensive . . . the definitive work on cryptography for computer programmers . . ." -Dr. Dobb's Journal

". . .easily ranks as one of the most authoritative in its field." -PC Magazine

". . .the bible of code hackers." -The Millennium Whole Earth Catalog

This new edition of the cryptography classic provides you with a comprehensive survey of modern cryptography. The book details how programmers and electronic communications professionals can use cryptography-the technique of enciphering and deciphering messages-to maintain the privacy of computer data. It describes dozens of cryptography algorithms, gives practical advice on how to implement them into cryptographic software, and shows how they can be used to solve security problems. Covering the latest developments in practical cryptographic techniques, this new edition shows programmers who design computer applications, networks, and storage systems how they can build security into their software and systems.

What's new in the Second Edition?
* New information on the Clipper Chip, including ways to defeat the key escrow mechanism
* New encryption algorithms, including algorithms from the former Soviet Union and South Africa, and the RC4 stream cipher
* The latest protocols for digital signatures, authentication, secure elections, digital cash, and more
* More detailed information on key management and cryptographic implementations

Customer Reviews:

Dated but indespensible.......2007-08-02

Sadly, this book is more than a few years old. That said, it is still the finest single volume introduction to data security in the modern age. For clarity of description, for illustration, and for its success at communicating essential concepts and ideas without resorting entirely to mathematics, it is without peer.

Every so often I look on Amazon and hope that I'll find Schneier has penned a third edition, updating this work with the results of the AES selection process and all the other recent developments in this suddenly fast paced field. Alas, I don't think that's going to happen. But I'm not sure that it would really make any difference -- the field now evolves so swiftly that any detailed, thorough volume would be obsolete by the time it reaches the shelves.

So instead of looking for something more recent, pick up Applied Cryptography. Read it and keep it close at hand as a reference (mine is almost falling apart from years of loving use). Nothing presents the fundamentals as well. If you need to know about a new cipher, a new hash, a new encryption mode or protocol, that's what the Internet is for.

But to really understand the underlying ideas, techniques, challenges, risks, and rewards of cryptography, nothing finer exists.

The unique and original applied cryptography book!.......2007-06-27

This book is extremely complete. It briefly covers the history of cryptography. It describes the political implications of cryptography and finally it shows how cryptography can be used in applications and presents the different cryptographic algorithms.

The algorithm section starts with a number theory primer.Honestly, I have found it a little bit too thin to learn all the needed background to fully understand the algorithms but on the other side, you cannot expect a simple 600 pages book to provide that background in the latest mathematical research number theories. It has at least the merit that it did stimulate my curiosity about number theory when I have read the first edition of this book.

Another point that makes this book interesting is that at the end of each chapter presenting the various algorithms in a given category, you will get Bruce Schneier opinion on which algorithm is the best. Of course, this type of information usually become outdated real fast but it is interesting to follow his thought process and test his predictions as the book grow older.

So, if you are looking for your first cryptography book, it should be this one.

Easy to read, perfect level of detail........2007-06-07

Great Book! The author's style makes this very easy to follow, and he frequently clarifies on topics which are difficult to grasp. Most importantly, he writes from a practical point of view; the material is very grounded and applicable instead of being a math textbook. That being said, he cites over 1600 sources; the book is riddled with leads to sources with more complete coverage for those interested in the fine details. Though I have some programming experience, I don't intend to write any programs; but it is interesting to read the logic in code. It was my goal to learn about modern cryptography and I have achieved that and much more.

Excellent Introduction.......2007-03-12

This book is now in the thirteenth reprinting of it's second edition with more than a hundred thousand copies sold. It is the definitive book on cryptography from the standpoint of a general overview of what sending secret messages is all about. It is not specifically oriented to the developer, but is more general in nature. There is not enough here for the mathematically inclined to seriously research the background of all the various systems.

As such consider this to be an introductory book on cryptography in general with a bit of history, a bit of story telling, an analysis of various cryptographic protocols and systems. There is source code provided for nine common protocols, and an invitation to order a three disk system that has source code for several more algorithms, functions, systems and additional text on various subjects. This disk set can only be sent to US and Canada addresses because of export rules on cryptographic information.

This is the definitive book on the subject. The only complaint I have is that it could stand to be done over in a third edition that would bring it more up to date.

A must-have book for understanding Cryptography........2006-03-11

This book has really shed a lot of light on cryptography for me. I honestly can't put it down--I wish I had paid more attention in my statistics classes so I could be able to apply some of the stuff the author talks about better. I am about half way through the book, and I haven't gotten to the point where it's more of a chore than a pleasure to read it (something I can't about my other technical books).
Glancing through the C source code at the end of the book started me thinking on the code implementation in my efforts - although I used Java althrough my life. I am not much comfortable with the C code because I was hoping for more goodie examples. If you want some practical guidance..you may little bit uncomforatble as well. At the end of the day if you are serious about Cryptography then you really need to get a copy of this.

Discrete-Time Signal Processing (2nd Edition)

Average customer rating:

Academic Propaganda
Destined for a standard?
Six star book on Digital Signal Processing
Good book from initial reading
yes, it is!

Discrete-Time Signal Processing (2nd Edition)
Alan V. Oppenheim , Ronald W. Schafer , and John R. Buck
Manufacturer: Prentice Hall
ProductGroup: Book
Binding: Hardcover

General | Science | Subjects | Books

General | Computers & Internet | Subjects | Books

General | Software | Computers & Internet | Subjects | Books

General | Arts & Photography | Subjects | Books

General | Computer Science & Information Systems | New & Used Textbooks | Stores | Books

Electrical & Electronics | Engineering | New & Used Textbooks | Stores | Books

All Titles | Qualifying Textbooks - Fall 2007 | Stores | Books

Arts & Photography | Qualifying Textbooks - Fall 2007 | Stores | Books

Computers & Internet | Qualifying Textbooks - Fall 2007 | Stores | Books

Professional | Qualifying Textbooks - Fall 2007 | Stores | Books

Science | Qualifying Textbooks - Fall 2007 | Stores | Books

Look Inside Art Books | Trip | Specialty Stores | Books

Look Inside Computer Books | Trip | Specialty Stores | Books

Look Inside Science Books | Trip | Specialty Stores | Books
Similar Items:

ASIN: 0137549202

Amazon.com

This is the standard text for introductory advanced undergraduate and first-year graduate level courses in signal processing. The text gives a coherent and exhaustive treatment of discrete-time linear systems, sampling, filtering and filter design, reconstruction, the discrete-time Fourier and z-transforms, Fourier analysis of signals, the fast Fourier transform, and spectral estimation. The author develops the basic theory independently for each of the transform domains and provides illustrative examples throughout to aid the reader. Discussions of applications in the areas of speech processing, consumer electronics, acoustics, radar, geophysical signal processing, and remote sensing help to place the theory in context. The text assumes a background in advanced calculus, including an introduction to complex variables and a basic familiarity with signals and linear systems theory. If you have this background, the book forms an up-to-date and self-contained introduction to discrete-time signal processing that is appropriate for students and researchers. Discrete-Time Signal Processing also includes an extensive bibliography.

Customer Reviews:

Academic Propaganda.......2007-05-14

Look, problems involving digital signals and systems can get very complicated, but the basics are just that--basic. This famous book on DSP is a quintessential example of academic propaganda: it misinforms the general public into thinking the subject matter is far harder than it is, while it privately informs insiders with very precise information.

Propaganda-free Alternative:

Signal Processing and Linear Systems by B. P. Lathi

Destined for a standard?.......2006-05-14

It is my pleasure to comment on this book which I recently purchased. I have two of Dr. Oppenheim's previous books. This book is a core integration of a topic with too many diverse starting points (mine was digital filters derived from Prony's method, not in the book by name). Dr. Bose was my first EE Professor. Alan Oppenheim was my second EE instructor. Alan (just finished MSEE at the time) had not published a book yet, but his focus was always on your questions. His product was your understanding. If this book is for your shelf, it will not harm it. If this topic is for your mind, this book was meticulously written for you. Lance Webb, PhDEE

Six star book on Digital Signal Processing.......2006-03-01

This is the outstanding 2nd edition of Oppenheim's classic DSP book, which for over two decades was the only real choice for a textbook on the subject. That was too bad, since the first edition was probably the worst thing I have ever seen in print - terse, incomprehensible, and with only a few awful and poorly illustrated examples. When I decided to take a refresher course in DSP, I was horrified to see our class would be using the second edition of that horrendous text. What I found instead was a completely rehabilitated textbook! This is not a beginner's DSP textbook by any stretch of the imagination, but absolutely everything is explained and there are plenty of well worked out examples. The end-of-chapter problems are broken down into simple, intermediate, and advanced problems with quite a few mind-puzzlers in the advanced section. Plus, the answers to the first 20 problems in every chapter are in the back of the book.
There is really nothing unique about the book's format. What does makes the book unique is the density and amount of material included. Just about every page is packed with well-explained important information. I highly recommend this book to anyone who has had a prior semester of an upper-level undergraduate class in Signals and Systems and wants to study DSP. An accompanying book that you might find helpful is "Understanding Digital Signal Processing" by Lyons. That book is good for getting an intuitive feel for DSP. Another book that will help you with some of the earlier concepts in this book (linear systems, DTFT, Z-transform, DFT, basic filter design) and some of the direct computations involved is "Schaum's Outline of Digital Signal Processing". Amazon does not show the table of contents, so I do that here:
1. Introduction.
2. Discrete-Time Signals and Systems.
Introduction. Discrete-time Signals: Sequences. Discrete-time Systems. Linear Time-Invariant Systems. Properties of Linear Time-Invariant Systems. Linear Constant-Coefficient Difference Equations. Frequency-Domain Representation of Discrete-Time Signals and Systems. Representation of Sequence by Fourier Transforms. Symmetry Properties of the Fourier Transform. Fourier Transform Theorems. Discrete-Time Random Signals. Summary.
3. The z-Transform.
Introduction. The z-Transform. Properties of the Region of Convergence for the z-Transform. The Inverse z-Transform. z-Transform Properties. Summary.
4. Sampling of Continuous-Time Signals.
Introduction. Periodic Sampling. Frequency-Domain Representation of Sampling. Reconstruction of a Bandlimited Signal from its Samples. Discrete-Time Processing of Continuous-Time Signals. Continuous-Time Processing of Discrete-Time Signals. Changing the Sampling Rate Using Discrete-Time Processing. Practical Considerations. Oversampling and Noise Shaping. Summary.
5. Transform Analysis of Linear Time-Invariant Systems.
Introduction. The Frequency Response of LTI Systems. System Functions for Systems Characterized by Linearity. Frequency Response for Rational System Functions. Relationship Between Magnitude and Phase. All-Pass Systems. Minimum-Phase Systems. Linear Systems with Generalized Linear Phase. Summary.
6. Structures for Discrete-Time Systems.
Introduction. Block Diagram Representation of Linear Constant-Coefficient Difference Equations. Signal Flow Graph Representation of Linear Constant-Coefficient Difference Equations. Basic Structures for IIR Systems. Transposed Forms. Basic Network Structures for FIR Systems. Overview of Finite-Precision Numerical Effects. The Effects of Coefficient Quantization. Effects of Roundoff Noise in Digital Filters. Zero-Input Limit Cycles in Fixed-Point Realizations of IIR Digital Filters. Summary.
7. Filter Design Techniques.
Introduction. Design of Discrete-Time IIR Filters from Continuous-Time Filters. Design of FIR Filters by Windowing. Examples of FIR Filter Design by the Kaiser Window Method. Optimum Approximations of FIR Filters. Examples of FIR Equiripple Approximation. Comments on IIR and FIR Digital Filters. Summary.
8. The Discrete Fourier Transform.
Introduction. Representation of Periodic Sequences: the Discrete Fourier Series. Summary of Properties of the DFS Representation of Periodic Sequences. The Fourier Transform of Periodic Signals. Sampling the Fourier Transform. Fourier Representation of Finite-Duration Sequences: The Discrete-Fourier Transform. Properties of the Discrete Fourier Transform. Summary of Properties of the Discrete Fourier Transform. Linear Convolution Using the Discrete Fourier Transform. The Discrete Cosine Transform (DCT). Summary.
9. Computation of the Discrete Fourier Transform.
Introduction. Efficient Computation of the Discrete Fourier Transform. The Goertzel Algorithm Decimation-in-Time FFT Algorithms. Decimation-in-Frequency FFT Algorithms. Practical Considerations Implementation of the DFT Using Convolution. Summary.
10. Fourier Analysis of Signals Using the Discrete Fourier Transform.
Introduction. Fourier Analysis of Signals Using the DFT. DFT Analysis of Sinusoidal Signals. The Time-Dependent Fourier Transform. Block Convolution Using the Time-Dependent Fourier Transform. Fourier Analysis of Nonstationary Signals. Fourier Analysis of Stationary Random Signals: the Periodogram. Spectrum Analysis of Random Signals Using Estimates of the Autocorrelation Sequence. Summary.
11. Discrete Hilbert Transforms.
Introduction. Real and Imaginary Part Sufficiency of the Fourier Transform for Causal Sequences. Sufficiency Theorems for Finite-Length Sequences. Relationships Between Magnitude and Phase. Hilbert Transform Relations for Complex Sequences. Summary.

Good book from initial reading.......2005-09-26

I haven't gone through this book all the way yet since classes haven't started; however, it seems to be a very well written book that is easy to get the necessary concepts out of easily. Once the class is done I will try to add a further review.

yes, it is!.......2004-12-26

This is the book that focuses on the concept more than any thing else which ,in turn, build up your insight through the material.

This book addresses discrete time signal processing issues in an ordinary fashion and doesn't cover more advanced topics like wavelets or statistical signal processing.

Maybe you would be interested in this book if you are that senior/first year graduate student looking forward a nice job with a high salary or a DSP engineer that is interested in keeping his job :)

Overall, nothing can get better than Oppenheim DSP 1975 but however, this is a nice volume if you don't have the preceding one.
It is almost the same quality isn't it?

Discrete Mathematics and Its Applications

Average customer rating:

Great buy
A good book
This book is interesting
Very, very helpful...
The best book on Discrete Math

Discrete Mathematics and Its Applications
Kenneth H. Rosen
Manufacturer: McGraw-Hill Science/Engineering/Math
ProductGroup: Book
Binding: Hardcover

General | Science | Subjects | Books

General | Mathematics | Science | Subjects | Books

Look Inside Science Books | Trip | Specialty Stores | Books

All Titles | Qualifying Textbooks - Fall 2007 | Stores | Books

Professional | Qualifying Textbooks - Fall 2007 | Stores | Books

Science | Qualifying Textbooks - Fall 2007 | Stores | Books
Similar Items:

Accessories:

Schaum's Outline of Discrete Mathematics (Schaum's)

ASIN: 0072930330

Book Description

Discrete Mathematics and its Applications is a focused introduction to the primary themes in a discrete mathematics course, as introduced through extensive applications, expansive discussion, and detailed exercise sets. These themes include mathematical reasoning, combinatorial analysis, discrete structures, algorithmic thinking, and enhanced problem-solving skills through modeling. Its intent is to demonstrate the relevance and practicality of discrete mathematics to all students. The Fifth Edition includes a more thorough and linear presentation of logic, proof types and proof writing, and mathematical reasoning. This enhanced coverage will provide students with a solid understanding of the material as it relates to their immediate field of study and other relevant subjects. The inclusion of applications and examples to key topics has been significantly addressed to add clarity to every subject. True to the Fourth Edition, the text-specific web site supplements the subject matter in meaningful ways, offering additional material for students and instructors. Discrete math is an active subject with new discoveries made every year. The continual growth and updates to the web site reflect the active nature of the topics being discussed. The book is appropriate for a one- or two-term introductory discrete mathematics course to be taken by students in a wide variety of majors, including computer science, mathematics, and engineering. College Algebra is the only explicit prerequisite.

Customer Reviews:

Great buy.......2007-03-15

Purchased for computer science course since it was required. Great price, good book.

A good book .......2006-05-20

I like this book and use it for teaching my students. As a teacher, you have the opportunity to select similar problems for class activity and homework assignment. Also, you can find not only simple and middle-level problems but also high-level problems to provide a good source for active students. Unfortunately, the author uses the letters "F" and "T" in the truth tables instead of much easier and perspective "0" and "1", which correspond to the real needs, e.g., in computer science. That's the most essential lack, which I've found by this time.

This book is interesting.......2006-04-11

I like the exclamations and the concepts/problem solving this book teaches. Maybe I am being swayed by the subject because I enjoy it, however, in comparison to other math books, this one livens it up and is a higher then the average mathematics book.

Very, very helpful..........2006-03-17

This manual was the only reason I got through discrete mathematics for computer science! It's awesome. Now if they only had one for the even solutions...

:-)

The best book on Discrete Math.......2006-03-16

This is the best book I have come across in Discrete Mathematics. It is fun to read and very easy to follow. The subject was taught as a very theoretical way in my course in college, but this book gave a whole new practical dimension to the topics, mainly in the chapters on Graph Theory.
It is a must buy for anybody who wants to know about the fun side of mathematics. That is not to say that this book is not suitable for the serious study program. It has everything that you may require in an Introductory Discrete Math course.
The problem sets are big and the answers to odd number questions are really helpful at times, when you are stuck. The author's detailing of almost every aspect in the book and coupled with the applications of the same idea make it easy to understand.
I have thoroughly enjoyed reading this book and I feel anybody who goes through this book, too will enjoy it immensely.

Average customer rating:

Perfect book for its purpose
Good explainations.
Great book
Great text on discrete mathematics especially for non-math majors
Great Introductory Book

Discrete Mathematics with Applications
Susanna S. Epp
Manufacturer: Brooks Cole
ProductGroup: Book
Binding: Hardcover

General | Science | Subjects | Books

General | Mathematics | Science | Subjects | Books

General | Computers & Internet | Subjects | Books

Look Inside Computer Books | Trip | Specialty Stores | Books

Look Inside Science Books | Trip | Specialty Stores | Books

All Titles | Qualifying Textbooks - Fall 2007 | Stores | Books

Computers & Internet | Qualifying Textbooks - Fall 2007 | Stores | Books

Professional | Qualifying Textbooks - Fall 2007 | Stores | Books

Science | Qualifying Textbooks - Fall 2007 | Stores | Books
Similar Items:

ASIN: 0534359450

Book Description

Susanna Epp's DISCRETE MATHEMATICS, THIRD EDITION provides a clear introduction to discrete mathematics. Renowned for her lucid, accessible prose, Epp explains complex, abstract concepts with clarity and precision. This book presents not only the major themes of discrete mathematics, but also the reasoning that underlies mathematical thought. Students develop the ability to think abstractly as they study the ideas of logic and proof. While learning about such concepts as logic circuits and computer addition, algorithm analysis, recursive thinking, computability, automata, cryptography, and combinatorics, students discover that the ideas of discrete mathematics underlie and are essential to the science and technology of the computer age. Overall, Epp's emphasis on reasoning provides students with a strong foundation for computer science and upper-level mathematics courses.

Customer Reviews:

Perfect book for its purpose.......2007-09-16

This book serves as a terrific introduction to concepts which are of paramount importance in upper-level math courses, most notably Probability Theory, Real Analysis, and Abstract Algebra. Moreover, it provides a solid basis for computer science majors who wish to write more logically sound and efficient programs. I regularly referred back to this in my Real Analysis and Probability courses, and I imagine others would do the same. Also, Dr. Epp's clear, conversational style doesn't hurt the student's confidence later in more rigorous academic enterprises, as well as a concise layout and reasonable pace. Highly recommended.

Good explainations........2007-08-15

This book explained concepts very well. The chapters were easy reads and I even referrred to this text for a Math Reasoning class. If you are a math genius and hate explainations then don't get this book. But if you like to fully understand what you are doing then I would suggest this book.

Great book.......2007-01-03

Wow, this is a great book. I bought this book as a secondary helper book to a really bad math textbook and this book helped me tons. It only seemed to help during the first half of the semester because by the end it wasn't covering the same material as the class was. But it covered the material that it did really really well.

It also has really good problems with good solutions that explain what's going on. Something that so many other math books seem to lack on Discrete math. Just a great book.

Great text on discrete mathematics especially for non-math majors.......2006-08-09

I used an earlier edition of this textbook in a discrete mathematics class that was required for those of us with a non-CS background enrolled in a MSCS program at Virginia Tech, and I found this to be an excellent and complete book on the subject. If you find yourself enrolled in a class using this book, you can be sure of two things - your instructor knows how to select good textbooks and also it won't matter if your instructor is a good teacher since this book does all of the work for him/her.

If you are enrolled in a class on discrete math and this textbook is not assigned, might I suggest you get a used copy of the previous edition. It is just as good as this current edition and used copies can easily be found dirt cheap. If you buy a copy of a previous edition the topics you'd be missing that are new to this edition would be expected value, conditional probability, Bayes' theorem, modular arithmetic, Fermat's little theorem and the Chinese remainder theorem, and RSA cryptography.

The author has included illuminating examples of all concepts throughout the textbook, defined all terms, and makes sure that each new concept introduced builds on previously explained material. Subjects covered include the logic of computation, including the predicate logic that is necessary for fully understanding artificial intelligence, methods of proof including the method of induction and also the terminology of sequences, number theory and combinatorics, O-notation and the calculation of the efficiency of algorithms, graph theory and discrete structures, and an introduction to concepts from the theory of computation. There are many exercises included, with the solutions to selected exercises in the back of the book.

This book only assumes mathematical maturity at the level of precalculus, excluding trigonometry. I highly recommend this text especially to students who are transitioning to computer science from some other discipline and need a firm foundation in the basics of that field. You'll find it useful as a foundational text for studying artificial intelligence, the theory of algorithms, mathematical models of computation, and the theory of computation. Another useful book on this subject is the "Schaum's Outline of Discrete Mathematics".

The table of contents are as follows:
1. The Logic of Compound Statements
2. The Logic of Quantified Statements
3. Elementary Number Theory and Methods of Proof
4. Sequences and Mathematical Induction
5. Set Theory
6. Counting
7. Functions
8. Recursion
9. O-Notation and the Efficiency of Algorithms
10. Relations
11. Graphs and Trees
12. Finite State Automata and Applications

Great Introductory Book.......2006-01-13

For a subject which has so much potential to be conveyed in complicated and esoteric ways, this book actually manages to present every single chapter in a clear and accessible way, even for those unfamiliar with formal logic.

It doesn't cover every single theorem you might come across in a first year class, but it comes close. I'd thoroughly recommend this book, even for self-study. I've used a couple of texts for this subject and while none of them are actually bad, this one is streets ahead for understandability and clarity.

Introduction to the Theory of Computation

Average customer rating:

My choice for textbook in my computation theory class
well-organized, progressive, and understandable
Great book on the subject
Very readable, diverse, and a little sparse
Most appropriate for CS students

Introduction to the Theory of Computation
Michael Sipser
Manufacturer: Course Technology
ProductGroup: Book
Binding: Hardcover

Information Theory | Computer Science | Computers & Internet | Subjects | Books

General | Computers & Internet | Subjects | Books

General | Science | Subjects | Books

General | Mathematics | Science | Subjects | Books

All Titles | Qualifying Textbooks - Fall 2007 | Stores | Books

Computers & Internet | Qualifying Textbooks - Fall 2007 | Stores | Books

Professional | Qualifying Textbooks - Fall 2007 | Stores | Books

Science | Qualifying Textbooks - Fall 2007 | Stores | Books
Similar Items:

ASIN: 053494728X

Amazon.com

"Intended as an upper-level undergraduate or introductory graduate text in computer science theory," this book lucidly covers the key concepts and theorems of the theory of computation. The presentation is remarkably clear; for example, the "proof idea," which offers the reader an intuitive feel for how the proof was constructed, accompanies many of the theorems and a proof. Introduction to the Theory of Computation covers the usual topics for this type of text plus it features a solid section on complexity theory--including an entire chapter on space complexity. The final chapter introduces more advanced topics, such as the discussion of complexity classes associated with probabilistic algorithms.

Book Description

Michael Sipser's emphasis on unifying computer science theory - rather than offering a collection of low-level details - sets the book apart, as do his intuitive explanations. Throughout the book, Sipser builds students' knowledge of conceptual tools used in computer science, the aesthetic sense they need to create elegant systems, and the ability to think through problems on their own.

Customer Reviews:

My choice for textbook in my computation theory class.......2007-10-01

I recently encountered this book at a publisher's booth at a computer conference and read it on the ride back home. This morning I made a trip to the college bookstore and notified them that it is the textbook that I will be using in my computation theory class this spring.
The chapter titles are:

0) Introduction - this chapter contains the fundamental mathematical background of sets, functions, graphs and proofs. For most students, it could be skipped or skimmed.
1) Regular languages - this chapter is an introduction to deterministic and nondeterministic finite automata and regular expressions.
2) Context-free languages - an introduction to context-free grammars and pushdown automata.
3) The Church-Turing theses - an introduction to Turing machines and the variants, such as multiple tapes and nondeterministic Turing machines.
4) Decidability - the definition of decidability and how Turing machines and finite automata are used to prove or disprove if a language is decidable.
5) Reducibility - the definition of reducible and how Turing machines can be used to execute reductions.
6) The recursion theorem - an introduction to the recursion theorem and some applications to formal theories.
7) Time complexity - the first chapter in the coverage of algorithmic complexity, in this case execution time.
8) Space complexity - an examination of the complexity of algorithms from the perspective of the amount of memory required.
9) Intractability - an examination of the problems that can be solved in principle but not in practice.
10) Advanced topics in complexity theory - approximation algorithms, probabilistic algorithms, alternation, interactive proof systems, parallel computation and cryptography.

There is less coverage of grammars than most books, which is replaced by more in the area of algorithmic analysis. In my opinion, that is an appropriate tradeoff, the analysis of algorithms gives the students some understanding of how automata are applied in computer science.
Another excellent feature of this book is the solutions to selected exercises that appear at the end of the chapters. My estimate is that reasonably detailed solutions to approximately one-third of the problems are included. This allows the students to work extra problems by themselves, and helps the instructor if they are asked to do another example in class that they have not already worked through.
The exposition is very good; I am convinced that the students will be able to read the material on their own, which is one more reason why I adopted this book for my course.

well-organized, progressive, and understandable.......2007-01-06

As an intro to the theoretical background to computer science goes, this book is about as readable and approachable as you can get.

It gives a very thorough treatment of the whole theoretical basis, from regular languages and pumping lemmas out through Turing machines and related issues, and on to some interesting language classes (like NP and PSpace-complete).

If there's a single sticking point with the book, it's that it insists on a very strict formalism (ie: everything is proof-based) -- something necessary for the topic, but it sometimes renders the material a bit hard to digest.

Great book on the subject.......2006-12-27

If you are interested in or for other reasons must read a book on this subject, this is the book. I took a class last semester which used Hopcroft as the text and I found myself often turning to this book for better understanding. This book is more intuitive and thus a bit less formal than Hopcroft but when trying to learn, understanding is better than mathematical formalism. If you are new to the subject, Sipser is the book to begin with.

Very readable, diverse, and a little sparse.......2006-11-25

This is a wonderful little gem of a book that presents the theory of computation in a fascinating way. It is targeted at advanced undergraduates in computer science, but assumes remarkably little prior knowledge, making it accessible to nearly anyone. The book covers a lot of ground, including the standard fare of automata, computability, and complexity results, plus some bonus material such as probablistic and parallel complexity, information theory, decidable logical theories, and other topics that are normally left out of introductory books. On top of this, the book is remarkably thin!

The best attribute of Sipser's book, though, is the engaging style. This is an easy book to read. You will not feel like you're running into a brick wall, as is sometimes the case with books on abstract topics. It's not so much that the book is slow or gentle (it's really not) as that it is interesting, engaging, and has a knack for stopping short of getting too caught up in details. A number of small things -- the occasional amusing exercise, the "proof idea" sections, or helpful pictures -- add up to an enjoyable reading experience.

Two cautions are appropriate to students considering this book. First, there are variations between authors in the definitions of various automata (especially PDAs). The differences are trivial, and more a matter of taste than of any real importance; but it could come up if you use Sipser as a supplement to a course that follows a different textbook. Second, the coverage of many topics in Sipser's book is brief and concise, sometimes more than you might like. Some important concepts (for example, pairwise distinguishability of strings) are only mentioned in exercises, not in the main chapter, so at least skim all the exercises even if you don't do them. The sketchy coverage is especially pronounced in advanced topics, so (as always) expect to do some filling in of concepts if you go on into further study of this area.

Most appropriate for CS students.......2006-06-01

As a teacher of the subject, I have had the chance to evaluate numerous books on the theory of computation. Of all the available texts, I think this one is the most appropriate for CS students. In the past I taught out of Dexter Kozen's book, which is incredibly elegant, but had some resistance from the students. Thinking it over I decided that Kozen's text, although beautiful, may be better suited to students pursuing a degree in pure math. Sipser's book, on the other hand, is more gentle. I find that Sipser demands far less mathematical maturity from his readers, and thus allows the difficulty to be shifted from excessive formalism to the inherent challenges present in the material. In addition, following Sipser's treatment, I was able to cover finite state machines and pushdown automata in far less time, thus allowing me to concentrate on computability and beyond. The book really shines in its treatment of computability theory, eloquently directing attention to some of the most beautiful aspects.

Another benefit of Sipser's book is the exercises, of which there are many more in this edition. Someone studying on their own should find the initial group of exercises in each section quite approachable. Even the more challenging problems are not incredibly hard, and typically draw their difficulty from the deeper themes of the chapter instead of obscure details.

If you are looking for an enjoyable, well-paced book with an introduction to computability and complexity that is truly inspiring, this is the one for you. A mathematician looking for a bit more rigor may do better with Kozen.

Numerical Recipes in C: The Art of Scientific Computing

Average customer rating:

talk about outdated
A classic book of numerical algorithms
Very nice book
A classic, and still worth having
Great compilation of numerical routines for C programmers

Numerical Recipes in C: The Art of Scientific Computing
William H. Press , Brian P. Flannery , Saul A. Teukolsky , and William T. Vetterling
Manufacturer: Cambridge University Press
ProductGroup: Book
Binding: Hardcover

General | Software | Computers & Internet | Subjects | Books

General | Science | Subjects | Books

General | Mathematics | Science | Subjects | Books

Programming Languages | Computer Science & Information Systems | New & Used Textbooks | Stores | Books

All Titles | Qualifying Textbooks - Fall 2007 | Stores | Books

Computers & Internet | Qualifying Textbooks - Fall 2007 | Stores | Books

Professional | Qualifying Textbooks - Fall 2007 | Stores | Books

Science | Qualifying Textbooks - Fall 2007 | Stores | Books
Similar Items:

ASIN: 0521431085

Book Description

The product of a unique collaboration among four leading scientists in academic research and industry, Numerical Recipes is a complete text and reference book on scientific computing. In a self-contained manner it proceeds from mathematical and theoretical considerations to actual practical computer routines. With over 100 new routines bringing the total to well over 300, plus upgraded versions of the original routines, the new edition remains the most practical, comprehensive handbook of scientific computing available today.

Customer Reviews:

talk about outdated.......2007-06-27

this book was likely a looker back in the day, but its 2007 now. Need to have better details for non "C"-users. wish i had bought "Idiots Guide to C".

A classic book of numerical algorithms.......2006-12-24

This book, although published 15 years ago, is still very useful. In fact, its more recent counterpart "Numerical Algorithms in C++" is a mess, and I wouldn't recommend it to anyone. The explanations of the algorithms that occur in each section of this book are top-notch. It helps with such questions as "Sure you know how to evaluate an integral with pencil and paper, but how do you do it with a computer?" Everything from linear algebra techniques to integration and evaluation of functions to the FFT and spectral applications are explained clearly and coded up in C. The code is great too, with the exception of one problem that several reviewers have already mentioned - the author has a FORTRAN-like programming style in which each implementation has arrays going from 1 to n versus 0 to n-1. This does cause some implementation problems if you want to transfer the algorithms into another programming language. Overall, though, I can't think of one book that does all of the heavy lifting that this one book does as well as it does in the arena of numerical algorithms.

The book is now available online. Just type "Numerical Recipes" into Google and click on the Numerical Recipes Home Page to peruse the entire book free of charge. You might also find the "Numerical Recipes in C Example Book" useful. That book is simply the source programs that demonstrate all of the Numerical Recipes subroutines. Each example program contains comments and is preceded by a short description of how it functions. I know I found it helpful in many cases.

Very nice book.......2006-08-27

A must buy for students or researchers who need numerical methods. Comprehensive topics. A good place to start to deeper levels. Online book is good for quick look.

A classic, and still worth having.......2006-07-12

"Numerical Recipes" has been a staple in computing libraries for many years, and for good reason. It provides immediately usable implementations of all the workhorses of numerical computation, in production-quality form. Maybe there are better implementations out there, FFTW for example, but getting something to work correctly always comes before getting it to work fast. Numerical computation is a specialty, and vanishingly few of us are specialists. As a result, getting this much specialist knowledge for the price of a very few hours' wage, fully debugged and documented, is a great bargain.

I have to agree with the critics who point out that the Gnu Scientific Library (GSL) is more complete in some areas, and offers better licensing terms. This collection has its own strengths, though, and not just in documentation. The writeup, however, is the major interface between the software and us, the bio-ware. GSL's collection of 'man' (help) pages serves a purpose, but this book's exposition describes a lot more of the background and rationale for the routines. The code and man pages are self-evident statements of the implementation - but "what" is a very different question than "what else" or "why."

This one may not serve all needs. You'd be amazed how many it does serve, though. If you need more than a Matlab session for numerical computing, you need this.

//wiredweird

Great compilation of numerical routines for C programmers.......2004-12-17

I found this book indispensible in my effort to develop profitable trading systems for futures and options and in my research in factor analysis and, more recently, in chronic fatigue syndrome and fibromyalgia. Anyone who programs in C or C++ and works with mathematics must have this book. It covers a surprisingly wide range of algorithms: routines are included for everything from handling Julian dates and solving systems of linear equations to determining eigenvectors and singular value decompositions, solving differential equations, doing numerical integration (quadrature), not to mention calculating fast fourier transforms, lomb periodograms and maximum entropy spectral analyses. While not always state-of-the-art, the routines are quite reliable (when used correctly), clearly-written, and easy to understand and use. I would strongly recommend this book (and the companion software) to anyone who programs in C and is literate in mathematics. I always keep a copy nearby.

Jeffrey Owen Katz, Ph.D.
Author: "The Encyclopedia of Trading Strategies" (McGraw Hill, 2000)

Numerical Recipes in FORTRAN: The Art of Scientific Computing

Average customer rating:

Outstanding reference book on numerical algorithms
Proprietary source the Achilles' heel for non-students
A Useful Tool for Programmers, Researchers, and Students
Indispensible, a classic in the field
Routines an more routines

Numerical Recipes in FORTRAN: The Art of Scientific Computing
William H. Press , Brian P. Flannery , Saul A. Teukolsky , and William T. Vetterling
Manufacturer: Cambridge University Press
ProductGroup: Book
Binding: Hardcover

General | Programming | Computers & Internet | Subjects | Books

General | Software | Computers & Internet | Subjects | Books

General | Mathematics | Science | Subjects | Books

Programming Languages | Computer Science & Information Systems | New & Used Textbooks | Stores | Books

All Deals | Blowout Books | Stores | Books

Computers & Internet | Blowout Books | Stores | Books

Science | Blowout Books | Stores | Books

All Titles | Qualifying Textbooks - Fall 2007 | Stores | Books

Computers & Internet | Qualifying Textbooks - Fall 2007 | Stores | Books

Professional | Qualifying Textbooks - Fall 2007 | Stores | Books

Science | Qualifying Textbooks - Fall 2007 | Stores | Books

Look Inside Computer Books | Trip | Specialty Stores | Books

Look Inside Science Books | Trip | Specialty Stores | Books
Similar Items:

ASIN: 052143064X

Book Description

This is the greatly revised and greatly expanded Second Edition of the hugely popular Numerical Recipes: The Art of Scientific Computing. The product of a unique collaboration among four leading scientists in academic research and industry Numerical Recipes is a complete text and reference book on scientific computing. In a self-contained manner it proceeds from mathematical and theoretical considerations to actual practical computer routines. With over 100 new routines bringing the total to well over 300, plus upgraded versions of the original routines, this new edition remains the most practical, comprehensive handbook of scientific computing available today. Highlights of the new material include: -A new chapter on integral equations and inverse methods -Multigrid and other methods for solving partial differential equations -Improved random number routines - Wavelet transforms -The statistical bootstrap method -A new chapter on "less-numerical" algorithms including compression coding and arbitrary precision arithmetic. The book retains the informal easy-to-read style that made the first edition so popular, while introducing some more advanced topics. It is an ideal textbook for scientists and engineers and an indispensable reference for anyone who works in scientific computing. The Second Edition is availabe in FORTRAN, the traditional language for numerical calculations and in the increasingly popular C language.

Customer Reviews:

Outstanding reference book on numerical algorithms.......2007-04-24

This is the single best book that I have found for teaching numerical methods in science and engineering to upper division undergraduates and graduate students. Students often comment that this should be the selected text even in the programming course because it provides both an overview of the methods and examples that demonstrate the application. The discussions are excellent and the Fortran 77 programs easy to follow even if one is more familiar with C or C++. You should not purchase the Fortran 90 version of this book without getting this book as well because the Fortran 90 book does not contain the excellent discussion of the methods and procedures. Rather it references this book for discussion and simply provides the F90 versions of the routines.

Proprietary source the Achilles' heel for non-students.......2002-12-03

I first bought this text in 1994 while doing scientific programming for graduate school work. A fellow graduate student had suggested I use an undocumented routine that (I later discovered) came from Numerical Recipes (NR). I was impressed enough with NR's presentation of ideas that I also bought the example book ISBN 0521437210 (which I've hardly cracked since) and a diskette of source code (which cost as much as the book but worth it). I was able to do a lot of basic research quickly with NR code, and I still occasionally use NR's routines.

The authors have certainly done a good job assimilating a lot of material. Since other reviewers have done well to highlight the importance and utility of this landmark book, there is no need to repeat those sentiments here. However, to this title's detriment, the authors consider their book to be a proprietary library of source code more valuable than the explanatory text discussing it (one can in fact download the text on-line though it's hardly worth the hassle). This perception is ironic since the authors confess that "the lineage of many programs in common circulation is often unclear" (p.xviii), and many details of presentation, ideas, and algorithms are clearly "borrowed" from other excellent (some now out-of-print) numerical methods books or journals.

I often wondered why NR routines occasionally adopted bizarre and/or obviously inefficient programming structures - over time I decided that this was probably done to make these algorithms appear as so not to clearly violate other published material. As a student, NR's legal disclaimers regarding derivative works (p.xvi) never bothered me and I was willing to overlook the sometimes unpolished source code insofar as it functioned properly. However, as a professional I now find the lack of fair-use provisions on the uncompiled source way too restrictive to rely on these routines in good conscience (I have to buy another textbook or license for every soft copy or machine upon which the source code resides!). I suspect this policy ultimately hurts NR's textbook sales: it would be nice to able to use and pass along the source code between professional colleagues without restriction because most would certainly buy (if they don't already own) the textbook to understand what the source does (just as I did). Source code used in scientific programming is practically worthless without proper documentation, and there's no better documentation than a full length textbook!

I have since expanded my numerical methods library to other references supporting true public-domain codes. With an expanded basis of comparison, I regret to say that I am becoming less and less impressed with NR's implementations and explanations. I am finding many of NR's algorithms to be inefficient or unnecessarily approximate, and - on rare occasion - buggy. There have been quite a few bugs uncovered over the years, and the NR web site has done a good job of keeping track of them (although I know of at least one bug uncorrected by NR to this day).

This book is excellent for students wanting a good reference for quick and dirty types of analyses or scientific computing. Professional programmers, scientists, engineers, specialists or analysts performing software development for laboratory or scientific research would be well advised to reference this title, but ultimately they will likely need to rely other resources if they require efficient and/or unrestricted (public-domain) source codes for their work.

(P.S. - A reviewer elsewhere noted that the "quality of the binding was terrible" and I've also found this to be the case. My hardcover is literally had to be taped on after a few years of use.)

A Useful Tool for Programmers, Researchers, and Students.......2002-07-05

This book contains hundreds of "canned codes" in the FORTRAN language. The book provides several variations of many popular numerical techniques and provides the most stream line (comp. time) codes available. Most codes allow for optimization to be build in, such as an RK4 (4th Order Runge-Kutta) with variable steps sizes. Great if you don't want to write your own code for a subroutine, or it you just don't know the method well enough to write it yourself. The book also provides some basic explaination of the techniques and codes with is very helpful so that the code is less of a black box, although its not that detailed.

There is also a CD available that has the codes already written and ready to go. I prefer to type it in on my own, or just make my own because it gives a better udnerstanding of what the code is doing. The biggest turn-off for me is that some codes have subroutines upon subroutines which can make things a mess.

All around a useful tool for programmers, researchers, and students.

Indispensible, a classic in the field.......2001-07-10

This volume, and its companions for other programming languages, is an absolute classic. The authors strike the right balance between cookbook solutions and theory, so that most of us get just enough background to choose the right algorithm but not so much to get drowned in theory. This edition is the first devoted only to Fortran, but is the second edition published by the authors. It includes a number of additions and corrections, many of which appeared in Computers in Physics (now the journal Computing in Science and Engineering published jointly by the IEEE and the APS). My only criticism is, where were these books twenty years ago when I needed them? I would recommend these books to anyone involved in the application of numerical methods. They are tremendous time savers.

I never bothered with the discs, as most of the routines are fairly short and not a problem to type in, but I recommend the companion example books to help get the routines running.

Routines an more routines.......2001-07-05

If you ever had to program a complicated numerical algorithm, such as SVD decomposition, Bessel functions, eigensystems or Fourier transform, you will know how useful this book is. All those problems, and many others, are presented, the theory is explained and the full code of a routine, which solves it, is given. This version brings the codes in FORTRAN 77, but there are versions for Pascal, C++ and Basic. If you need any routine, you just have to "cut and paste" it from the book into your program.

Average customer rating:

An excellent and thorough book
Probably the best of its kind. Good for MS students and up
excellent discussion of what the models mean

Discrete Choice Methods with Simulation
Kenneth E. Train
Manufacturer: Cambridge University Press
ProductGroup: Book
Binding: Paperback

Econometrics | Economics | Business & Investing | Subjects | Books

Statistics | Economics | Business & Investing | Subjects | Books

General | Popular Economics | Business & Investing | Subjects | Books

General | Business & Investing | Subjects | Books

General | Engineering | Professional & Technical | Subjects | Books

Look Inside Business Books | Trip | Specialty Stores | Books

Look Inside Nonfiction Books | Trip | Specialty Stores | Books

Look Inside Science Books | Trip | Specialty Stores | Books

All Deals | Blowout Books | Stores | Books

Business & Investing | Blowout Books | Stores | Books

Science | Blowout Books | Stores | Books

All Titles | Qualifying Textbooks - Fall 2007 | Stores | Books

Business & Investing | Qualifying Textbooks - Fall 2007 | Stores | Books

Professional | Qualifying Textbooks - Fall 2007 | Stores | Books

Science | Qualifying Textbooks - Fall 2007 | Stores | Books
Similar Items:

ASIN: 0521017157

Book Description

Focusing on the many advances that are made possible by simulation, this book describes the new generation of discrete choice methods. Researchers use these statistical methods to examine the choices that consumers, households, firms, and other agents make. Each of the major models is covered: logit, generalized extreme value, or GEV (including nested and cross-nested logits), probit, and mixed logit, plus a variety of specifications that build on these basics. The procedures are applicable in many fields, including energy, transportation, environmental studies, health, labor, and marketing.

Download Description

This book describes the new generation of discrete choice methods, focusing on the many advances that are made possible by simulation. Researchers use these statistical methods to examine the choices that consumers, households, firms, and other agents make. Each of the major models is covered: logit, generalized extreme value, or GEV (including nested and cross-nested logits), probit, and mixed logit, plus a variety of specifications that build on these basics. Simulation-assisted estimation procedures are investigated and compared, including maximum simulated likelihood, method of simulated moments, and method of simulated scores. Procedures for drawing from densities are described, including variance reduction techniques such as anithetics and Halton draws. Recent advances in Bayesian procedures are explored, including the use of the Metropolis-Hastings algorithm and its variant Gibbs sampling. No other book incorporates all these fields, which have arisen in the past 20 years. The procedures are applicable in many fields, including energy, transportation, environmental studies, health, labor, and marketing.

Customer Reviews:

An excellent and thorough book.......2006-03-08

This book is one of the best for introduction to Discrete choice models. I had been using Ben-Akiva & Lerman, but feel this book should be read along with that one for a better understanding of choice models. Also, Train covers recent advances in the field and provides a good introduction to Halton draws. He really makes sure you get the concepts and the online lecture series are really excellent.

Probably the best of its kind. Good for MS students and up .......2005-04-24

-Enjoyable read
-Does not assume PhD level of econometrics
-Explanations are clear and concise

Actually, an advanced undergrad may find this book usefull as well.
Is this the best discrete choice methods book ever published?
Let y = 1 or 0 where 1 = yes, this is the best and 0 = No, the book is not the best. Also let P = Prob (y=1). My results show P = 0.98 (see forthcoming Econometrica article).
While finishing a Master's Thesis in applied econ which focuses on a multinomial logit model, I have sought good info on this topic. Not having gone through the rigors of a PhD program, I have gone through many of the important books and articles which address discrete choice modeling methods some of which address a post-doc audience only. Dr. Train's is by far the best I have encountered. His explanations are concise yet not too dense (see Amemiya). I first encountered many of the concepts in other publications but did understand them until reading Train's book. In my opinion Train has that rare quality of being, not only an exceptional economist, but quite enjoyable to read.

excellent discussion of what the models mean.......2005-03-17

If I could give this book six stars I would. It's simply one of the best statistics books I've ever read.

This book is very well-written by one of the experts in the field. It covers logit models and the various generalizations (GEV, mixed logit, probit, etc.) in detail, along with a thorough discussion of modern estimation of these models. What I find most useful about it is that the words-to-equations density is highly favorable. The equations you need are there, but the words you need are there too, making sure you understand the model assumptions inside and out. Each equation is explained thoroughly and the surrounding discussion probes the model to bring the reader to a critical understanding of what exactly is implied by the model. Too often complex statistical models are treated in a "black box" fashion. The dirty little secret is that it's easier for the author to do this. Train doesn't take the easy way out. The fact that his web site has truly excellent support--including a large number of webinars in addition to the more usual papers, software, etc.--makes this book a doubly valuable item. See http://elsa.berkeley.edu/~train/distant.html for even more.

Average customer rating:

Definitive book for scientific computing
Disappointed
This book contains recipes in C piled together in one class, DON'T BUY
context not included
C++ Recipes

Numerical Recipes in C++: The Art of Scientific Computing
William T. Vetterling , and Brian P. Flannery
Manufacturer: Cambridge University Press
ProductGroup: Book
Binding: Hardcover

General | Programming | Computers & Internet | Subjects | Books

General | Science | Subjects | Books

General | Mathematics | Science | Subjects | Books

All Titles | Qualifying Textbooks - Fall 2007 | Stores | Books

Computers & Internet | Qualifying Textbooks - Fall 2007 | Stores | Books

Professional | Qualifying Textbooks - Fall 2007 | Stores | Books

Science | Qualifying Textbooks - Fall 2007 | Stores | Books
Similar Items:

ASIN: 0521750334

Book Description

The product of a unique collaboration among four leading scientists in academic research and industry, Numerical Recipes is a comprehensive text and reference work on scientific computing. Thoroughly self-contained, it proceeds from mathematical and theoretical considerations to actual, practical computer routines. This new version incorporates completely new C++ versions of the more than 300 Numerical Recipes Second Edition routines widely recognized as the most accessible and practical basis for scientific computing, in addition to including the full mathematical and explanatory contents of Numerical Recipes in C. Key Features:

Includes linear algebra, interpolation, special functions, random numbers, nonlinear sets of equations, optimization, eigensystems, Fourier methods and wavelets, statistical tests, ODEs and PDEs, integral equations, and inverse theory.

A wealth of tricks and tips for scientific computing in C++

The routines, in ANSI/ISO C++ source code, can be used with almost any existing C++ vector/matrix class library, according to user preference

Includes a simple class library for stand-alone use Other new Numerical Recipes products for your library...

Numerical Recipes Example Book [C++]

Numerical Recipes Code CDROM with Windows, DOS, or Macintosh Single Screen License--v2.10 including C++, Second Edition

Numerical Recipes Code CDROM with LINUX or UNIX Single Screen License v2.10 including C++, Second Edition

Numerical Recipes Code CDROM with Windows, DOS, or Macintosh Single Screen License

Customer Reviews:

Definitive book for scientific computing.......2007-06-29

Forget about the bad comment about this book. Those guys do not understand scientific computing at all.

About C style functions and C++ classes: for speed, C style functions still take the lead. The method provided here considered speed seriously. even in vector wrapping, reference trick is used everywhere to max speed.

If you are professional programmer, you will appreciate the careful design in vector and matrix. I am not saying it is perfect. There are better ways to handle vector and matrix more consistently, like boost lib. but within the limited scope of this book, the care for details is just incredibly good.

And the extra charge for the typed program, it is worth it. So stop complaining please.

Disappointed.......2007-03-12

I returned this book. The licensing is very restrictive. The book comes with an "Immediate License" that allows you to type the routines into your computer and use for personal and noncommercial purposes. Any other use or distribution requires the purchase of an additional license.

Some of the routines (Quicksort, p 336) are not very well coded: a bunch of one letter variable names, loops that only exit on break.

This book contains recipes in C piled together in one class, DON'T BUY.......2007-01-25

Book contains the same numerical procedures as in recipes in C piled up in one class. Using this book is like using C without exploitation of object capacities on C++.
What I would recommend is to get the vector library Blitz++ and Numerical recipes in C; both are available for free on-line. Using Blitz++ you achieve speed of Fortran 90 and easy exposition of C++.
And that's what author of this book should have done, write all the procedures based on blitz++.

This book uses C++ only in its title.

context not included.......2006-11-21

Have only read over the first four chapters but so far the book seems to be little more than a print out of minimally commented source code with no context as to how/where/why one would apply the code or even explanations of what the code is doing. All code seen so far relies heavily on the included classes so the 'guts' of the recipe is not transparent with in the chapter. Sample user input and program output are not always listed with code but rather at the end of the chapter.

Still may prove to be good reference.

C++ Recipes.......2006-11-03

It is very helpful in scientific computing. I recommend it for an experienced programmer. If you are a fledgling, get another book to complement it.

Books: