null
Loading... Please wait...
FREE SHIPPING on All Unbranded Items LEARN MORE
Print This Page

Algorithms and Complexity

List Price: $66.99
SKU:
9780367659486
Quantity:
Minimum Purchase
25 unit(s)
  • Availability: Confirm prior to ordering
  • Branding: minimum 50 pieces (add’l costs below)
  • Check Freight Rates (branded products only)

Branding Options (v), Availability & Lead Times

  • 1-Color Imprint: $2.00 ea.
  • Promo-Page Insert: $2.50 ea. (full-color printed, single-sided page)
  • Belly-Band Wrap: $2.50 ea. (full-color printed)
  • Set-Up Charge: $45 per decoration
FULL DETAILS
  • Availability: Product availability changes daily, so please confirm your quantity is available prior to placing an order.
  • Branded Products: allow 10 business days from proof approval for production. Branding options may be limited or unavailable based on product design or cover artwork.
  • Unbranded Products: allow 3-5 business days for shipping. All Unbranded items receive FREE ground shipping in the US. Inquire for international shipping.
  • RETURNS/CANCELLATIONS: All orders, branded or unbranded, are NON-CANCELLABLE and NON-RETURNABLE once a purchase order has been received.
  • Product Details

    Author:
    Herbert S. Wilf
    Format:
    Paperback
    Pages:
    219
    Publisher:
    CRC Press (September 30, 2020)
    Language:
    English
    ISBN-13:
    9780367659486
    Weight:
    12oz
    Dimensions:
    6" x 9"
    File:
    TAYLORFRANCIS-TayFran_260825151505541-20260825.xml
    Folder:
    TAYLORFRANCIS
    List Price:
    $66.99
    Case Pack:
    10
    As low as:
    $63.64
    Publisher Identifier:
    P-CRC
    Discount Code:
    H
    Country of Origin:
    United States
    Pub Discount:
    30
    Imprint:
    A K Peters/CRC Press
  • Overview

    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.