Đang chuẩn bị nút TẢI XUỐNG, xin hãy chờ
Tải xuống
The word "technology" can also be used to refer to a collection of techniques. In this context, it is the current state of humanity's knowledge of how to combine resources to produce desired products, to solve problems, fulfill needs, or satisfy wants; it includes technical methods, skills, processes, techniques, tools and raw materials. When combined with another term, such as "medical technology" or "space technology", it refers to the state of the respective field's knowledge and tools. "State-of-the-art technology" refers to the high technology available to humanity in any field | Algorithms and Complexity Herbert S. Wilf University of Pennsylvania Philadelphia PA 19104-6395 Copyright Notice Copyright 1994 by Herbert S. Wilf. This material may be reproduced for any educational purpose multiple copies may be made for classes etc. Charges if any for reproduced copies must be just enough to recover reasonable costs of reproduction. Reproduction for commercial purposes is prohibited. This cover page must be included in all distributed copies. Internet Edition Summer 1994 This edition of Algorithms and Complexity is available at the web site http www cis.upenn.edu wilf . It may be taken at no charge by all interested persons. Comments and corrections are welcome and should be sent to wilf@math.upenn.edu A Second Edition of this book was published in 2003 and can be purchased now. The Second Edition contains solutions to most of the exercises. CONTENTS Chapter 0 What This Book Is About 0.1 Background.1 0.2 Hard vs. easy problems.2 0.3 A preview.4 Chapter 1 Mathematical Preliminaries 1.1 Orders of magnitude .5 1.2 Positional number systems. 11 1.3 Manipulations with series . 14 1.4 Recurrence relations. 16 1.5 Counting . 21 1.6 Graphs . 24 Chapter 2 Recursive Algorithms 2.1 Introduction. 30 2.2 Quicksort . 31 2.3 Recursive graph algorithms. 38 2.4 Fast matrix multiplication. 47 2.5 The discrete Fourier transform. 50 2.6 Applications of the FFT. 56 2.7 A review. 60 Chapter 3 The Network Flow Problem 3.1 Introduction. 63 3.2 Algorithms for the network flow problem. 64 3.3 The algorithm of Ford and Fulkerson . 65 3.4 The max-flow min-cut theorem. 69 3.5 The complexity of the Ford-Fulkerson algorithm . 70 3.6 Layered networks. 72 3.7 The MPM Algorithm. 76 3.8 Applications of network flow . 77 Chapter 4 Algorithms in the Theory of Numbers 4.1 Preliminaries . 81 4.2 The greatest common divisor . 82 4.3 The extended Euclidean algorithm . 85 4.4 Primality testing . 87 4.5 Interlude the ring of integers modulo n. 89 4.6 Pseudoprimality tests . 92 4.7 Proof
