Book Description
This book offers a well-balanced presentation on designing algorithms, complexity analysis of algorithms, and computational complexity that is accessible to mainstream computer science students who have a background in college algebra and discrete structures.
Customer Reviews:
Foundations of Algorithms Using C++ Pseudocode.......2007-02-18
Received the book in just four days...so it was prompt service and the book was in excellent condition when it arrived. Overall, I'm extremely satisfied with the service provided and the condition of the book.
Awful Textbook.......2006-10-27
I'm currently taking a course on Algorithm Analysis, and we're using this as our textbook. At first glance this book seems like a tome of information, and extremely thorough. However, once you start to read it you realize exactly how many errors and typos made it all the way to the Third Edition. On the bright side, the appendices cover discrete mathematics very well.
Here's two samples of the errors that have poked through:
pg. 7, has a grievous error in exchangesort:
for(i=0; i
<=1;i++)
That's obviously incorrect. It should be i
<=(n-1).
pg. 50, recursive binary search:
else if(x == array[mid])
Again, that should be else if(x
<= array[mid]), otherwise the code does the same thing as the previous if statement.
So frankly, skip this book. It contains errors that even a neophyte programmer ought to be able to catch.
For beginners? Sure........2003-10-07
I attend the school in which these two professors received their tenureship, and I must say, that this book is an absolute disappointment. They state that the reader "require no knowledge of calculus, only College Algebra" yet they go through the theories with little to no explanation, and assuming that the reader knows caculus. The book does a pitiful job of explaining chained matrix multiplication, graph theory, dynamic programming, Diskstra's algorithms, et al. It's NOT the best book, we're using the 3rd edition and it is just as bad as the 2nd edition. There are tons of typos and errors alike.
really good for beginners.......2003-01-04
In fact, it doesn't have C++ but C pseudocode; other than that, the book is marvelous in terms of being an introduction to the analysis of algorithms. The code is very clear and almost always has commentaries where they should be. Another point to remark is that the authors frequently encourage students to deepen in advanced concepts by presenting concrete bibliography. A very good reference book, I must say.
Dr. Jihad M. Jaam.......2002-07-21
A very good text[book] either for students or teachers.
Well written, and easy to understand. The concepts of
algorithms are well presented.
I like very much this textbook and so happy to discover it.
I teach algorithms for computer science students at Qatar
university, I used many different textbooks, but really
this is the one that I admire.
However, I regret to not have an instructor's manual for
it. I encourge deeply the authors to prepare one.
Average customer rating:
- Good textbook for graduate and advanced undergraduate course
- Assistant Researcher
|
Cryptanalysis of Number Theoretic Ciphers (Computational Mathematics)
Jr., Samuel S. Wagstaff
Manufacturer: Chapman & Hall/CRC
ProductGroup: Book
Binding: Hardcover
 Encryption
| Security & Encryption
| Web Development
| Computers & Internet
| Subjects
| Books
Cryptography
| Algorithms
| Programming
| Computers & Internet
| Subjects
| Books
General
| Programming
| Computers & Internet
| Subjects
| Books
General
| Computers & Internet
| Subjects
| Books
Chaos & Systems
| Physics
| Science
| Subjects
| Books
System Theory
| Physics
| Science
| Subjects
| Books
General
| Science
| Subjects
| Books
General
| Applied
| Mathematics
| Science
| Subjects
| Books
Calculus
| Pure Mathematics
| Mathematics
| Science
| Subjects
| Books
Combinatorics
| Pure Mathematics
| Mathematics
| Science
| Subjects
| Books
Number Theory
| Pure Mathematics
| Mathematics
| Science
| Subjects
| Books
General
| Mathematics
| Science
| Subjects
| Books
General
| Applied
| Mathematics
| Professional Science
| Professional & Technical
| Subjects
| Books
Chaos & Systems
| Mathematics
| Professional Science
| Professional & Technical
| Subjects
| Books
Combinatorics
| Pure Mathematics
| Mathematics
| Professional Science
| Professional & Technical
| Subjects
| Books
Number Theory
| Pure Mathematics
| Mathematics
| Professional Science
| Professional & Technical
| Subjects
| Books
System Theory
| Physics
| Professional Science
| Professional & Technical
| Subjects
| Books
Look Inside Computer 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:
-
Elliptic Curves: Number Theory and Cryptography (Discrete Mathematics and Its Applications)
-
Applied Cryptanalysis: Breaking Ciphers in the Real World
-
Cryptography: Theory and Practice, Third Edition (Discrete Mathematics and Its Applications)
-
Practical Cryptography
ASIN: 1584881534 |
Book Description
At the heart of modern cryptographic algorithms lies computational number theory. Whether you're encrypting or decrypting ciphers, a solid background in number theory is essential for success. Written by a number theorist and practicing cryptographer, Cryptanalysis of Number Theoretic Ciphers takes you from basic number theory to the inner workings of ciphers and protocols. First, the book provides the mathematical background needed in cryptography as well as definitions and simple examples from cryptography. It includes summaries of elementary number theory and group theory, as well as common methods of finding or constructing large random primes, factoring large integers, and computing discrete logarithms. Next, it describes a selection of cryptographic algorithms, most of which use number theory. Finally, the book presents methods of attack on the cryptographic algorithms and assesses their effectiveness. For each attack method the author lists the systems it applies to and tells how they may be broken with it. Computational number theorists are some of the most successful cryptanalysts against public key systems. Cryptanalysis of Number Theoretic Ciphers builds a solid foundation in number theory and shows you how to apply it not only when breaking ciphers, but also when designing ones that are difficult to break.
Customer Reviews:
Good textbook for graduate and advanced undergraduate course.......2003-06-15
I read the book and is almost self contained. No knowledge in Number Theory is assumed. Has a great combination of text and math. Last few chapters could have been better.
Assistant Researcher.......2003-04-07
An excellent book. I am a beginning cryptographer with some statistics, discrete math, user level crypto and programming under my belt - crossing over from another field. This book is an excellent read with proper amounts of examples and theorems. It is easy to follow and would make a good reference.
Book Description
Economics doesn't have to be a mystery anymore. FOUNDATIONS OF MATHEMATICAL AND COMPUTATION ECONOMICS shows you how mathematics impacts economics and econometrics using easy-to-understand language and plenty of examples. Plus, it goes in-depth into computation and computational economics so you'll know how to handle those situations in your first economics job. Get ready for both the test and the workforce with this economics textbook.
Customer Reviews:
Good introduction.......2007-08-20
There is little doubt that econometrics is becoming more intensely mathematical with each passing year, making considerable demands on the intellectual capabilities of economists and also exploiting the computational powers of the latest computing machinery. Therefore, individuals who have ambitions to become involved in econometrics must begin mathematical preparation early in their education. This book fills the need for such individuals, and is written for the advanced undergraduate student in economics. It covers elementary calculus, including multivariable calculus, linear algebra, dynamic optimization, elementary numerical analysis, and a brief introduction to the theory of dynamical systems. More esoteric topics such as game theory, fixed-point analysis, and partial differential equations are not discussed in the book.
Some of the more interesting or useful features of the book include:
· The use of Matlab as a tool for calculating quantities of interest, such as the diagonalization of matrices and the numerical solution of differential equations, and its ability to access data on Excel spreadsheets. SAS has been the niche language for many in economics and econometrics, but this has been changing in recent years due to the availability of relatively inexpensive but professional symbolic programming packages like Mathematica, Matlab, and Maple. The reader who is charged with doing econometric analysis on very large data sets, with possibly millions of rows will of course not be able to implement them in Excel due to its row limitation size, vitiating the use of Matlab for such analysis.
· The inclusion of various economic concepts and models in the text, particularly in the exercises, in order to continually reinforce the idea that the book is written for economists.
· The discussion early on in the book on the philosophy of mathematics, to dissuade the skeptical reader as to the value of learning the mathematics for use in econometrics. Interestingly, the author points to the use of mathematics by none other than Karl Marx. It would be interesting to contemplate what Marx would have thought about the current state of econometrics, as heavily mathematical as it is. Along these same lines, the field of labor economics, which Marx could indeed be classified under, is currently one that makes heavy use of quantitative analysis.
· The discussion on the calibration of quantitative models in econometrics. The author points to the origin of calibration in physics, but emphasizes its necessity in the validation of models. However, and somewhat disappointingly, he does not elaborate on calibration in the book, which is unfortunate since in practice, particularly in the financial industry, calibration is extremely important and has become almost a field unto itself.
Book Description
Winner of the 2004 DeGroot Prize
The DeGroot Prize is awarded every two years by the International Society
for Bayesian Analysis in recognition of an important, timely, thorough and
notably original contribution to the statistics literature.
This graduate-level textbook presents an introduction to Bayesian statistics and decision theory. Its scope covers both the basic ideas of statistical theory, and also some of the more modern and advanced topics of Bayesian statistics such as complete class theorems, the Stein effect, Bayesian model choice, hierarchical and empirical Bayes modeling, Monte Carlo integration, including Gibbs sampling and other MCMC techniques.
The second edition includes a new chapter on model choice (Chapter 7) and the chapter on Bayesian calculations (6) has been extensively revised. Chapter 4 includes a new section on dynamic models. In Chapter 3, the material on noninformative priors has been expanded, and Chapter 10 has been supplemented with more examples. The Bayesian Choice will be suitable as a text for courses on Bayesian analysis, decision theory or a combination of them.
Customer Reviews:
second edition of excellent treatise on Bayesian methods.......2001-06-11
Robert is the author or co-author of a number of excellently written statistical texts from a Bayesian viewpoint. This text is no exception. It was quite popular in its first edition in 1994 (a translation and correction of an earlier text in French). The rapid advancement in Bayesian applications and theory due to the success of computer-intensive methods such as Markov Chain Monte Carlo Methods justifies an update in 2001.
Chapter 7 on model choice is entirely new and Chapter 6 on Bayesian calculations is extensively revised. Chapter 10 on hierarchical models and empirical Bayes extensions has been supplemented with a number of recent examples. Bayesian hierarchical models are now being used in the development of clinical trials particularly in the medical device industry.
This is an advanced graduate text in Bayesian statistics and has a wealth of references to the literature. In that respect it is very similar to the fine text by Bernardo and Smith (1994) "Bayesian Theory" but is a little more current.
An important reference for all statistical researchers, I highly recommend it for a graduate course text in Bayesian methods as well as for a reference book.
A thorough description of bayesian statistics.......2000-07-02
The book is a good introduction to bayesian decision theory. The plenty examples in the book are helpful in the understanding of the subject, but one could wish a more detailed description of the bayesian paradigm. People with little experience with statistics should maybe consider another book.
Why you should be bayesian.......2000-04-21
Robert's defend the bayesian choice is one of the clearest and convincing in the last years. The book is concise and direct and the math kept at an appropriate level. I can only hope Springer republises it ASAP.
Average customer rating:
|
Foundations of Computational Mathematics (London Mathematical Society Lecture Note Series)
Manufacturer: Cambridge University Press
ProductGroup: Book
Binding: Paperback
General
| Science
| Subjects
| Books
General
| Applied
| Mathematics
| Science
| Subjects
| Books
Probability & Statistics
| Applied
| Mathematics
| Science
| Subjects
| Books
General
| Mathematics
| Science
| Subjects
| Books
Mathematical Analysis
| Mathematics
| Science
| Subjects
| Books
General
| Medicine
| Subjects
| Books
General
| Applied
| Mathematics
| Professional Science
| Professional & Technical
| Subjects
| Books
Statistics
| Applied
| Mathematics
| Professional Science
| Professional & Technical
| Subjects
| Books
Mathematical Analysis
| Mathematics
| Professional Science
| Professional & Technical
| Subjects
| Books
ASIN: 0521003490 |
Book Description
The Society for the Foundations of Computational Mathematics supports fundamental research in a wide spectrum of computational mathematics and its application areas. It regularly organizes conferences and workshops which bring together leading researchers in the diverse fields impinging on all aspects of computation. This book presents thirteen papers written by plenary speakers from the 1999 conference, all of whom are the foremost figures in their respective fields. Topics covered include complexity theory, approximation theory, optimization, computational geometry, stochastic systems and the computation of partial differential equations.
Book Description
Foundations of Cryptography surveys the main paradigms, approaches and techniques used to conceptualize, define and provide solutions to natural cryptographic problems. The author starts by presenting some of the central tools; that is, computational difficulty (in the form of one-way functions), pseudorandomness, and zero-knowledge proofs. Based on these tools, the emphasis is shifted to the treatment of basic applications such as encryption and signature schemes as well as the design of general secure cryptographic protocols. The author has created a unique overview that includes well over 100 references. The accent is on the clarification of fundamental concepts and on demonstrating the feasibility of solving several central cryptographic problems. Foundations of Cryptography is an invaluable resource for all students, researchers and practitioners interested in the foundations that underpin modern cryptography.
Book Description
This essential companion volume to Chaitin's highly successful "The Limits of Mathematics", also published by Springer, gives a brilliant historical survey of the work of this century on the foundations of mathematics, in which the author was a major participant.
The Unknowable is a very readable and concrete introduction to Chaitin's ideas, and it includes a detailed explanation of the programming language used by Chaitin in both volumes. It will enable computer users to interact with the author's proofs and discover for themselves how they work. The software for
The
Unknowable can be downloaded from the author's Web site.
Customer Reviews:
More annoying than amusing.......2004-01-21
First the good part about this book. Chaitins first chapter is quite good. Here he outlines the results of Godel, Turing and his own. It is very readable. Without going into the real mathematics he can really make you feel you understand these deep ideas. The later chapters go more deeply in to the ideas presented there and illustrate them with lisp computer programs. Especially the search for lisp programs that evaluate to themselves is amusing.
But let's now focus on the parts of the books that I did not like. His exposition is mixed with an account of how he first learned these result. I am charmed the first time when he explains how he read so many books as a kid. But soon I do not want to hear again what he felt as 12 year old. Also he keeps comparing his own work to that of other scientist. We really need to now that he is just as good as Godel and as Turing.
For example he takes pages to explain that Kolmogorov ripped of his ideas. What I also find funny as well is both chapter 1 and chapter 6 give an identical link to "my first major paper".
Sigh. He's the best, we get it, ok?, now please move on.
Then one more thing. The computer programs that he uses are in lisp. That is fine by me, lisp is a beautiful language. But do you think he uses any of the available dialects? No, of course not, he introduces he own strange version. The programs given do not run in clisp for example.
So to sum it up. I learned his own result on incompleness (that one cannot produce the shortes program for a particular function) and that is a nice result. Reading the rest of the book is more annoying than amusing.
Not a modest man but why should he be?.......2000-05-17
...reasons that I rated this a 5 star read.
Firstly I agree that Chaitin is not a modest man. I don't think that really matters, because he has made a major contribution to my understanding of this whole area which previously I had found almost impenetrable. The only other criticism I had is the excessive use of the exclamation mark!
In all other respects this is a superb book. I found the chapter introducing LISP a little dense (much like me) but I read a book called "The Little Lisper" which is a great book in itself and that helped me.
The real beauty of this book for me was working through the various LISP exercises and beginning to understand, to feel almost, the logic and concepts behind the work of people such as Godel and Turing.
In other words I felt able to walk for a while in the footsteps of geniuses - and I would count Chaitin among that number. END
Future Classic - Beautiful Ideas.......2000-05-13
In the 21st century mathematicians will debate the meaning of Chaitin's theorems just as we now debate the meaning of Godel's and Cantor's theorems. We have a rare opportunity here to read the author's interpretation. This book is wonderful. It is, by far, the most polished and most readable of Chaitin's publications. Much of the value of this book comes from the terse LISP proofs, which can be appreciated for their beauty and craftiness. The reader must not only read the proofs but also run the proofs. This can be accomplished by downloading the author's LISP interpreter applet.
If you like Hofstadter's GEB you'll love this book but you'll come out of it with a much more optimistic outlook. Hofstadter believes that man is just a machine. I don't think Chaitin shares that view. I know that Godel didn't share that view. Nevertheless, parts of mathematics are beyond our understanding. We have gotten use to the idea that there are true propositions that can't be proved. Chaitin defines numbers, like omega, that can't be known. But this means that there is no end to mathematics. It is optimistic because it means that theorems that have been proved and numbers that are known are all the more interesting. If something is unknowable well then it's just unknowable, but if you can know that it's unknowable then that's really remarkable.
Save your money.......2000-05-12
This Book is horrible. The only point of the Unknowable is to prove that Chaitin is as smart as Godel and Turing. The entire book can also be retrived off his homepage. If you want to have a good overview of this topic buy Limits of Mathematics by Chaitin.
A Complete Waste of Time.......2000-04-30
I checked out this book from the library with high hope. It turned out to be a complete waste of time. The only purpose of this book is to claim that the author is as great as Godel and Turing. The reason? Unknowable.
Average customer rating:
|
Advanced Problems in Constructive Approximation: 3rd International Dortmund Meeting on Approximation Theory (IDoMAT) 2001 (International Series of Numerical Mathematics)
Manufacturer: Birkhäuser Basel
ProductGroup: Book
Binding: Hardcover
General
| Science
| Subjects
| Books
Functional Analysis
| Pure Mathematics
| Mathematics
| Science
| Subjects
| Books
General
| Mathematics
| Science
| Subjects
| Books
Mathematical Analysis
| Mathematics
| Science
| Subjects
| Books
Number Systems
| Mathematics
| Science
| Subjects
| Books
Mathematical Analysis
| Mathematics
| Professional Science
| Professional & Technical
| Subjects
| Books
Number Systems
| Mathematics
| Professional Science
| Professional & Technical
| Subjects
| Books
Functional Analysis
| Pure Mathematics
| Mathematics
| Professional Science
| Professional & Technical
| Subjects
| Books
ASIN: 3764366486 |
Book Description
This volume contains refereed articles originating from the 3rd International Dortmund Meeting on Approximation Theory in Witten-Bommerholz. The contributors are renowned international experts in their individual fields of research, including, in particular, approximation methods, orthogonal polynomials, radial basis functions, multivariate spline approximation and interpolation, Pade approximation, polynomial approximation, and quasi-interpolation.
Average customer rating:
|
Algorithms: Their Complexity and Efficiency (Wiley Series in Computing)
Lydia Kronsjo
Manufacturer: John Wiley & Sons Inc
ProductGroup: Book
Binding: Hardcover
General
| Algorithms
| Programming
| Computers & Internet
| Subjects
| Books
General
| Operating Systems
| Computers & Internet
| Subjects
| Books
General
| Mathematics
| Science
| Subjects
| Books
Mathematics
| Professional Science
| Professional & Technical
| Subjects
| Books
| Applied
| Chaos & Systems
| Geometry & Topology
| Mathematical Analysis
| Mathematical Physics
| Number Systems
| Pure Mathematics
| Transformations
| Trigonometry
ASIN: 0471912018 |
Books:
- Functional Analysis
- Fundamental Methods of Mathematical Economics
- Fundamentals of Atmospheric Modeling
- Fundamentals of Power Electronics (Second Edition)
- Galois Theory (Universitext)
- Global Behavior of Nonlinear Difference Equations of Higher Order with Applications (Mathematics and Its Applications)
- Hard Disk Drive Servo Systems (Advances in Industrial Control)
- History: Fiction or Science? (Chronology, No. 1)
- History: Fiction or Science? (Chronology, No. 1)
- History: Fiction or Science? (Chronology, No. 1)
Books Index
Books Home
Recommended Books
- History: Fiction or Science
- Frankenstein Makes a Sandwich
- Bitter Lemons of Cyprus
- Civilization in the West, Volume II
- Cinema for Spanish Conversation, Second Edition
- Differential Equations, Dynamical Systems, and an Introduction to Chaos
- Desert Solitaire
- Petroleum Marketing in Africa: Issues in Pricing, Taxation and Investment
- Basic Income on the Agenda: Policy Objectives and Political Chances
- A Rich Broth: Memoirs of a Canadian Diplomat
Software Engineering: A Practitioner's Approach
Operating System Concepts
Understanding Object-Oriented Programming With Java: Updated Edition (New Java 2 Coverage)
Modern Programming Languages: A Practical Introduction
An Introduction to Formal Language and Automata
