• Menu
  • Skip to right header navigation
  • Skip to main content
  • Skip to secondary navigation
  • Skip to primary sidebar

OnlineProgrammingBooks.com

Legally Free Computer Books

  • All Categories
  • All Books
  • All Categories
  • All Books
  • About Us
  • Privacy policy
  • Disclaimer
  • Subscribe
  • Contact
You are here: Home ▶ Mathematics ▶ Algorithms and Complexity

Algorithms and Complexity

March 24, 2006

Algorithms and Complexity

This free classic text provides the perfect introduction to the tools of algorithmic design and analysis, concentrating on basic principles and illustrating them with well-chosen paradigms. An algorithm is a method for solving a class of problems on a computer.

Book Description

The complexity of an algorithm is the cost, measured in running time, or storage, or whatever units are relevant, of using the algorithm to solve one of those problems. This book is about algorithms and complexity, and so it is about methods for solving problems on computers and the costs (usually the running time) of using those methods.

Table of Contents

  • Mathematical Preliminaries
  • Recursive Algorithms
  • The Network Flow Problem
  • Algorithms in the Theory of Numbers
  • NP-completeness

Download Free PDF / Read Online

Author(s): Herbert S. Wilf
Publisher: A K Peters/CRC Press
Format(s): PDF
File size: 838.42 KB
Number of pages: 139
Link: Download.

Similar Books:

  1. Advances in Evolutionary Algorithms
  2. Greedy Algorithms
  3. Tabu Search
  4. Computational Modeling and Complexity Science
  5. A Problem Course in Mathematical Logic
Previous Post: « Intellectual Property Issues in Software
Next Post: The J2EE Tutorial, Second Edition »

Primary Sidebar

Get Latest Updates

  • Facebook
  • Pinterest
  • RSS
  • Twitter
  • YouTube
  • About Us
  • Privacy policy
  • Disclaimer
  • Subscribe
  • Contact

Copyright © 2006–2021 OnlineProgrammingBooks.com