The Art of Computer Programming, Vol. 4A: Combinatorial Algorithms, Part 1 - Image 1

£50.07

Addison Wesley The Art of Computer Programming, Vol. 4A: Combinatorial Algorithms, Part 1

Name: The Art of Computer Programming, Vol. 4A: Combinatorial Algorithms, Part 1
Brand: Addison Wesley
Price: 50.07 GBP
Availability: InStock

Introduction to Programming

It has never been this cheap. We have no record of a lower price.

£50 today · cheaper than every other day in the last 3 months

NEW HERE?

Amazon shows you one price. We show you all of them.

Tosheroon watches Amazon prices so you don't have to. Every product on Amazon has a price history — we make it visible. Set the price you'd actually pay, and we'll email you the second it gets there. No app, no account, one email.

WHAT'S ON THIS PAGE

↓ Price chart
when this has been cheap or pricey

↓ Forecast
where the price is heading next

↓ Statistics
all-time high & low, recent range

↑ Price alert
name your number, we'll email you

Price History & Forecast

Grey patches = out of stock. Cheaper = lower on the chart. Hover for exact prices.

Last 47 days · 47 data points (no recent data)

Historical

Generating forecast…

Price Distribution

Price distribution over 47 days • 3 price levels

Days at Price

Current Price

Price Analysis

Most common price: £52 (27 days, 57.4%)

Price range: £50 - £53

Price levels: 3 different prices over 47 days

Description

The Art of Computer Programming, Volume 4A: Combinatorial Algorithms, Part 1 Knuth’s multivolume analysis of algorithms is widely recognized as the definitive description of classical computer science. The first three volumes of this work have long comprised a unique and invaluable resource in programming theory and practice. Scientists have marveled at the beauty and elegance of Knuth’s analysis, while practicing programmers have successfully applied his “cookbook” solutions to their day-to-day problems. The level of these first three volumes has remained so high, and they have displayed so wide and deep a familiarity with the art of computer programming, that a sufficient “review” of future volumes could almost be: “Knuth, Volume n has been published.” –Data Processing Digest Knuth, Volume n has been published, where n = 4A. In this long-awaited new volume, the old master turns his attention to some of his favorite topics in broadword computation and combinatorial generation (exhaustively listing fundamental combinatorial objects, such as permutations, partitions, and trees), as well as his more recent interests, such as binary decision diagrams. The hallmark qualities that distinguish his previous volumes are manifest here anew: detailed coverage of the basics, illustrated with well-chosen examples; occasional forays into more esoteric topics and problems at the frontiers of research; impeccable writing peppered with occasional bits of humor; extensive collections of exercises, all with solutions or helpful hints; a careful attention to history; implementations of many of the algorithms in his classic step-by-step form. There is an amazing amount of information on each page. Knuth has obviously thought long and hard about which topics and results are most central and important, and then, what are the most intuitive and succinct ways of presenting that material. Since the areas that he covers in this volume have exploded since he first envisioned writing about them, it is wonderful how he has managed to provide such thorough treatment in so few pages. –Frank Ruskey, Department of Computer Science, University of Victoria The book is Volume 4A, because Volume 4 has itself become a multivolume undertaking. Combinatorial searching is a rich and important topic, and Knuth has too much to say about it that is new, interesting, and useful to fit into a single volume, or two, or maybe even three. This book alone includes approximately 1500 exercises, with answers for self-study, plus hundreds of useful facts that cannot be found in any other publication. Volume 4A surely belongs beside the first three volumes of this classic work in every serious programmer’s library. Finally, after a wait of more than thirty-five years, the first part of Volume 4 is at last ready for publication. Check out the boxed set that brings together Volumes 1 - 4A in one elegant case, and offers the purchaser a $50 discount off the price of buying the four volumes individually. p> The Art of Computer Programming, Volumes 1-4A Boxed Set, 3/e ISBN: 0321751043

Key Features

New Store Stock

Product Specifications

Brand: Addison Wesley
Format: hardcover
ASIN: 0201038048
Category: Books > Subjects > Computing & Internet > Programming > Introduction to Programming
Domain: Amazon UK
Release Date: 03 February 2011
Listed Since: 03 April 2004

Barcode

No barcode data available

Addison Wesley The Art of Computer Programming, Vol. 4A: Combinatorial Algorithms, Part 1

It has never been this cheap. We have no record of a lower price.

Price History & Forecast

Price Distribution

Price Analysis

Description

Key Features

Product Specifications

Barcode

Similar Products You Might Like

Art of Computer Programming, The, Volumes 1-4B, Boxed Set: Fundamental Algorithms / Seminumerical Algorithms / Sorting and Searching / Combinatorial ... Part 1 / Combinatorial Algorithms, Part 2

Combinatorial Programming: Methods and Applications: Proceedings of the NATO Advanced Study Institute held at the Palais des Congrès, Versailles, ... 1974: 19 (Nato Science Series C:, 19)

A Programmer's Companion to Algorithm Analysis

Algorithms in C, Parts 1-5 (Bundle): Fundamentals, Data Structures, Sorting, Searching, and Graph Algorithms (3rd Edition)

A Programmer's Companion to Algorithm Analysis

Geometry of Cuts and Metrics: 15 (Algorithms and Combinatorics, 15)

Formal Methods, Informally: How to Write Programs That Work

Starting Out with C++ plus MyProgrammingLab with Pearson eText, International Edition: Early Objects

Programming Challenges: The Programming Contest Training Manual (Texts in Computer Science)

Routledge Teaching and Learning Computer Programming Book

Complexity and Approximation: In Memory of Ker-I Ko: 12000 (Lecture Notes in Computer Science, 12000)

Introduction to Programming with C++: International Edition

Techniques for Designing and Analyzing Algorithms (Chapman & Hall/CRC Cryptography and Network Security Series)

Algorithms – ESA 2005: 13th Annual European Symposium, Palma de Mallorca, Spain, October 3-6, 2005, Proceedings: 3669 (Lecture Notes in Computer Science, 3669)

MIT Press Problem Solving with Python - Computational Thinking

Guide to Competitive Programming: Learning and Improving Algorithms Through Contests (Undergraduate Topics in Computer Science)

Addison Wesley Art of Computer Programming Volume 4B

CGP GCSE Computer Science OCR Complete Revision & Practice

Algorithms as a Basis of Modern Applied Mathematics: 404 (Studies in Fuzziness and Soft Computing, 404)

Mathematics and Computer Science: Algorithims, Trees, Combinatorics and Probabilities (Trends in Mathematics)

Springer - Patterns in Permutations and Words Book

Computer Science: A Structured Programming Approach

Genetic Systems Programming: Theory and Experiences: 13 (Studies in Computational Intelligence, 13)

Algorithmic Adventures: From Knowledge to Magic