Home   FAQs   New Arrivals   Specials   Pricing & Shipping   Location   Corporate Services   Why Choose Bookware?  
 Search:   
Call our store: 9955 5567 (from within Sydney) or 1800 734 567 (from outside Sydney)
 View Cart   Check Out   
 
Browse by Subject
 TAFE Accounting
 TAFE I.T./Computing
 TAFE - Other
I.T
 .NET
 Windows 8
 Adobe CS6
 Cisco
 CCNA 2012
 CCNP 2012
 Java
 VB
 ASP
 Web Design
 E-Commerce
 Project Management
 ITIL
 Macintosh
 Mobile Devices
 Linux
 Windows Server 2012
 SQL Server 2012
 SAP
Certification
 MCITP
 MCTS
Economics and Business
 Accounting
 Business Information Systems
 Economics
 Finance
 Management
 Marketing
 TAX
 Human Resources
Academic
 Law
 Nursing
 Medical
 Psychology
 Engineering

The Art of Computer Programming, Volume 4A: Combinatorial Algorithms, Part 1

by: Knuth Donald E

Notify me when in stock

On-line Price: $65.03 (includes GST)

Hardcover package 912

13%Off Retail Price

You save: $10.00

Usually ships within 4 - 6 weeks. Price/availability/options for all orders placed will be confirmed by reply email before processing.
_____________________
N.Sydney : On Order (reserve your copy)

Retail Price: $75.03

Publisher: ,07.03.11

Category: SOFTWARE ENGINEERING Level: B/I/A

ISBN: 0201038048
ISBN13: 9780201038040

Add to Shopping Cart

The first part of the long-awaited fourth volume of Don Knuth's masterwork: part of the world's most influential series of programming books. Brings together definitive new coverage of broadword computation, combinatorial generation, fundamental combinatorial objects, and more. Presents hundreds of new exercises, with detailed answers. A new classic from the world's most influential programming author, whose previous work was honored alongside Einstein's as one of the century's best physical-science monographs. In this long-awaited new Volume 4A of Don Knuth's The Art of Computer Programming, the 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. It encompasses revised and updated versions of the six most recent smaller books ('fascicles') he has written on these topics 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 research frontier; impeccable writing peppered with occasional bits of humor; extensive collections of exercises, all with solutions or helpful hints; a careful attention to history; and implementations of many 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 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 remarkable that he has been able to provide such thorough treatment in so few pages.