Handbook of Randomized Computing: Volume I/II - Combinatorial Optimization - Sanguthevar Rajasekaran - Books - Springer-Verlag New York Inc. - 9781461348863 - December 7, 2013
In case cover and title do not match, the title is correct

Sanguthevar Rajasekaran
Handbook of Randomized Computing: Volume I/II - Combinatorial Optimization Softcover reprint of the original 1st ed. 2001 edition

Price
S$ 72.50
excl. VAT

Ordered from remote warehouse

Expected delivery Jan 13 - 23, 2026
Christmas presents can be returned until 31 January

Our customers say:

14-day return policy in accordance with European consumer protection law
Top ranking on Trustpilot
Add to your iMusic wish list

A brief introduction to randomized algorithms In the analysis of algorithms, at least three different measures of performance can be used: the best case, the worst case, and the average case. 2 For instance, the worst case run time of Hoare's quicksort is O(n ), whereas its average case run time is only O(nlogn).

1045 pages, 35 black & white illustrations, biography

Media Books     Paperback Book   (Book with soft cover and glued back)
Released December 7, 2013
ISBN13 9781461348863
Publishers Springer-Verlag New York Inc.
Pages 996
Dimensions 155 × 235 × 56 mm   ·   1.47 kg
Language English  
Editor Pardalos, Panos M.
Editor Rajasekaran, Sanguthevar
Editor Reif, J.H.
Editor Rolim, Jose

More by Sanguthevar Rajasekaran

Show all

See all of Sanguthevar Rajasekaran ( e.g. Hardcover Book and Paperback Book )