BIBLIO is the largest independent book marketplace in the world, with over 100 million books.

Skip to content

Algorithms and Complexity

Algorithms and Complexity

Algorithms and Complexity Hardback - 2002 - 2nd Edition

by Herbert S. Wilf

Add to wish list
  • New
  • Hardback
New

Description

Hardcover. New. New Book; Fast Shipping from UK; Not signed; Not First Edition; This book is an introductory textbook on the design and analysis of algorithms.  This second edition will differ from the present edition mainly in that solutions to most of the exercises will be included.
Ask the seller a question Add to wish list
A$205.93
A$15.44 Delivery to USA
Standard delivery: 7 to 12 days
More delivery options
Ships from Ria Christie Collections (Greater London, United Kingdom)

Details

  • Title Algorithms and Complexity
  • Author Herbert S. Wilf
  • Binding Hardback
  • Edition number 2nd
  • Edition 2
  • Condition New
  • Pages 232
  • Volumes 1
  • Language ENG
  • Publisher A K PETERS
  • Publication date 2002-12-09
  • Features Bibliography
  • Bookseller's Inventory # ria9781568811789_inp
  • ISBN 9781568811789 / 1568811780
  • Weight 0.95 lbs (0.43 kg)
  • Dimensions 9.1 x 6.1 x 0.7 in (23.11 x 15.49 x 1.78 cm)
  • Category Mathematics
  • Library of Congress Catalogue Number 2002072765
  • Dewey Decimal Code 511.8
  • Quantity available 833

About Ria Christie Collections Greater London, United Kingdom

Biblio member since 2014

Hello We are professional online booksellers. We sell mostly new books and textbooks and we do our best to provide a competitive price. We are based in Greater London, UK. We pride ourselves by providing a good customer service throughout, shipping the items quickly and replying to customer queries promptly. Ria Christie Collections

Terms of Sale:

30 day return guarantee, with full refund including original shipping costs for up to 30 days after delivery if an item arrives misdescribed or damaged.

Browse books from Ria Christie Collections

Reader reviews for Algorithms and Complexity

From the publisher

This book is an introductory textbook on the design and analysis of algorithms. The author uses a careful selection of a few topics to illustrate the tools for algorithm analysis. Recursive algorithms are illustrated by Quicksort, FFT, fast matrix multiplications, and others. Algorithms associated with the network flow problem are fundamental in many areas of graph connectivity, matching theory, etc. Algorithms in number theory are discussed with some applications to public key encryption. This second edition will differ from the present edition mainly in that solutions to most of the exercises will be included.
tracking-