A01=Herbert S. Wilf
advanced algorithm analysis for researchers
Author_Herbert S. Wilf
Category=PBW
Chromatic Number
Chromatic Polynomial
circuit
computational complexity
cryptographic applications
discrete mathematics
Edge Capacities
eq_isMigrated=1
eq_isMigrated=2
eq_nobargain
euler
Euler Circuit
Extended Euclidean Algorithm
Flow Function
Ford Fulkerson Algorithm
graph algorithms
Graph Coloring
Graph Coloring Problem
hamilton
Hamiltonian Path
Hard Computational Problem
independent
Independent Set
Input Bit String
integer
Largest Independent Set
Layered Network
Max Flow Min Cut Theorem
Maximum Independent Set
Network Flow Problem
network flow problems
Np Complete Problem
number theory
path
polynomial
Polynomial Time
positive
primality testing
Primitive Roots Modulo
problem solving
Pseudoprimality Test
recursive algorithms
Recursive Calls
set
time
Turing Machine
Turing machines
Unlabeled Graphs
Product details
- ISBN 9781568811789
- Weight: 460g
- Dimensions: 152 x 229mm
- Publication Date: 09 Dec 2002
- Publisher: Taylor & Francis Inc
- Publication City/Country: US
- Product Form: Hardback
Secure
checkout
Fast Shipping
Easy returns
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.
Herbert S. Wilf
