One way to advance the science of computational geometry is to make a comprehensive study of fundamental operations that are used in many different algorithms. This monograph attempts such an investigation in the case of two basic predicates: the counterclockwise relation pqr, which states that the circle through points (p, q, r) is traversed counterclockwise when we encounter the points in cyclic order p, q, r, p, ..; and the incircle relation pqrs, which states that s lies inside that circle if pqr is true, or outside that circle if pqr is false. The author, Donald E. Knuth, is one of the...
One way to advance the science of computational geometry is to make a comprehensive study of fundamental operations that are used in many different al...
A quantitative study of the efficiency of computer methods requires an in-depth understanding of both mathematics and computer science. This monograph, derived from an advanced computer science course at Stanford University, builds on the fundamentals of combinatorial analysis and complex variable theory to present many of the major paradigms used in the precise analysis of algorithms, emphasizing the more difficult notions. The authors cover recurrence relations, operator methods, and asymptotic analysis in a format that is terse enough for easy reference yet detailed enough for those...
A quantitative study of the efficiency of computer methods requires an in-depth understanding of both mathematics and computer science. This monogr...
The intital French version of this text was a series of expository lectures that were given at the University of Montreal in November 1975. The book uses the appealing theory of stable marriage to introduce and illustrate a variety of important concepts and techniques of computer science and mathematics: data structures, control structures, combinatorics, probability, analysis, algebra, and especially the analysis of algorithms. The presentation is elementary, and the topics are interesting to nonspecialists. The theory is quite beautiful and developing rapidly. Exercises with answers, an...
The intital French version of this text was a series of expository lectures that were given at the University of Montreal in November 1975. The book u...
Das Buch Arithmetik ist eine Ubersetzung des vierten Kapitels der legendaren Werkreihe "The Art of Computer Programming" von Donald E. Knuth in der neuesten Fassung. Es handelt sich um eine umfangreiche Einfuhrung in die Computeralgebra, die den neuesten Stand der Forschung berucksichtigt. Donald E. Knuth versteht es, die Algorithmen didaktisch sehr geschickt und ohne Kompromisse bei der Strenge aufzubereiten. Das Buch enthalt ausserdem Hunderte von Aufgaben verschiedener Schwierigkeitsgrade mit Losungen. Der Ubersetzer, Prof. Dr. R. Loos, lehrt an der Universitat Tubingen
Das Buch Arithmetik ist eine Ubersetzung des vierten Kapitels der legendaren Werkreihe "The Art of Computer Programming" von Donald E. Knuth in der ne...
