TAILIEUCHUNG - Algorithms and Complexity

For the past several years mathematics majors in the computing track at the University of Pennsylvania have taken a course in continuous algorithms (numerical analysis) in the junior year, and in discrete algorithms in the senior year. This book has grown out of the senior course as I have been teaching it recently. It has also been tried out on a large class of computer science and mathematics majors, including seniors and graduate students, with good results. | 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 wilf . It may be taken at no charge by all interested persons. Comments and corrections are welcome and should be sent to wilf@ CONTENTS Chapter 0 What This Book Is About Hard vs. easy A Chapter 1 Mathematical Preliminaries Orders of magnitude .5 Positional number systems. 11 Manipulations with series. 14 Recurrence relations. 16 Counting . 21 Graphs . 24 Chapter 2 Recursive Algorithms Introduction. 30 Quicksort. 31 Recursive graph algorithms. 38 Fast matrix multiplication. 47 The discrete Fourier transform. 50 Applications of the FFT. 56 A review. 60 Chapter 3 The Network Flow Problem Introduction. 63 Algorithms for the network flow problem. 64 The algorithm of Ford and Fulkerson. 65 The max-flow min-cut theorem. 69 The complexity of the Ford-Fulkerson algorithm . 70 Layered networks. 72 The MPM Algorithm. 76 Applications of network flow. 77 Chapter 4 Algorithms in the Theory of Numbers Preliminaries. 81 The greatest common divisor. 82 The extended Euclidean algorithm. 85 Primality testing. 87 Interlude the ring of integers modulo n. 89 Pseudoprimality tests. 92 Proof of goodness of the strong pseudoprimality test. 94 Factoring and cryptography. 97 Factoring large integers. 99 Proving iii .

TỪ KHÓA LIÊN QUAN
TAILIEUCHUNG - Chia sẻ tài liệu không giới hạn
Địa chỉ : 444 Hoang Hoa Tham, Hanoi, Viet Nam
Website : tailieuchung.com
Email : tailieuchung20@gmail.com
Tailieuchung.com là thư viện tài liệu trực tuyến, nơi chia sẽ trao đổi hàng triệu tài liệu như luận văn đồ án, sách, giáo trình, đề thi.
Chúng tôi không chịu trách nhiệm liên quan đến các vấn đề bản quyền nội dung tài liệu được thành viên tự nguyện đăng tải lên, nếu phát hiện thấy tài liệu xấu hoặc tài liệu có bản quyền xin hãy email cho chúng tôi.
Đã phát hiện trình chặn quảng cáo AdBlock
Trang web này phụ thuộc vào doanh thu từ số lần hiển thị quảng cáo để tồn tại. Vui lòng tắt trình chặn quảng cáo của bạn hoặc tạm dừng tính năng chặn quảng cáo cho trang web này.