Algorithms and complexity

>> Google Books

所蔵情報QRコード

Algorithms and complexity / Herbert S. Wilf

資料種別:: 図書
出版情報:: Englewood Cliffs, N.J. : Prentice-Hall, c1986
形態:: vi, 231 p. ; 24 cm
著者名:: Wilf, Herbert S., 1931- <DA00720098>
ISBN:: 9780130219732 [0130219738]
書誌ID:: BA00472218

子書誌情報

フルテキスト

所蔵情報

他の版・巻

書誌詳細

注記:

Includes bibliographies and index

主題:

Algorithms; Computational complexity; Problem solving--Data processing

言語:

英語

目次情報:

Preface

Preface to the Second Edition

What this Book Is About / 0：

Background / 0.1：

Hard versus Easy Problems / 0.2：

A Preview / 0.3：

Mathematical Preliminaries / 1：

Orders of Magnitude / 1.1：

Positional Number Systems / 1.2：

Manipulations with Series / 1.3：

Recurrence Relations / 1.4：

Counting / 1.5：

Graphs / 1.6：

Recursive Algorithms / 2：

Introduction / 2.1：

Quicksort / 2.2：

Recursive Graph Algorithms / 2.3：

Fast Matrix Multiplication / 2.4：

The Discrete Fourier Transform / 2.5：

Applications of the FFT / 2.6：

A Review / 2.7：

Bibliography / 2.8：

The Network Flow Problem / 3：

Algorithms for the Network Flow Problem / 3.1：

The Algorithm of Ford and Fulkerson / 3.3：

The Max-Flow Min-Cut Theorem / 3.4：

The Complexity of the Ford-Fulkerson Algorithm / 3.5：

Layered Networks / 3.6：

The MPM Algorithm / 3.7：

Applications of Network Flow / 3.8：

Algorithms in the Theory of Numbers / 4：

Preliminaries / 4.1：

The Greatest Common Divisor / 4.2：

The Extended Euclidean Algorithm / 4.3：

Primality Testing / 4.4：

Interlude: The Ring of Integers Modulo n / 4.5：

Pseudoprimality Tests / 4.6：

Proof of Goodness of the Strong Pseudoprimality Test / 4.7：

Factoring and Cryptography / 4.8：

Factoring Large Integers / 4.9：

Proving Primality / 4.10：

NP-Completeness / 5：

Turing Machines / 5.1：

Cook's Theorem / 5.3：

Some Other NP-Complete Problems / 5.4：

Half a Loaf ... / 5.5：

Backtracking (I): Independent Sets / 5.6：

Backtracking (II): Graph Coloring / 5.7：

Approximate Algorithms for Hard Problems / 5.8：

Hints and Solutions for Selected Problems

Index

Preface

Preface to the Second Edition

What this Book Is About / 0：

Background / 0.1：

Hard versus Easy Problems / 0.2：

A Preview / 0.3：

続きを見る

東工大ブックレビュー

類似資料:

1 図書 Combinatorial algorithms Nijenhuis, Albert, Wilf, Herbert S., 1931- Academic Press	7 図書 Finite sections of some classical inequalities Wilf, Herbert S., 1931- Springer-Verlag
2 図書 Combinatorial algorithms for computers and calculators Nijenhuis, Albert, Wilf, Herbert S., 1931- Academic Press	8 図書 Combinatorial optimization : algorithms and complexity Papadimitriou, Christos H., Steiglitz, Kenneth, 1939- Dover Publications
3 図書 Algorithms : their complexity and efficiency Kronsjö, Lydia Wiley	9 図書 Complexity theory : current research Ambos-Spies, K. (Klaus), Homer, S. (Steven), Schöning, Uwe, 1955- Press Syndicate of the University of Cambridge
4 図書 Algorithms, their complexity and efficiency Kronsjö, Lydia John Wiley	10 図書 Computational complexity of sequential and parallel algorithms Kronsjö, Lydia Wiley
5 図書 Computers and intractability : a guide to the theory of NP-completeness (: pbk) Garey, Michael R., Johnson, David S., 1945- W. H. Freeman	11 図書 Mathematical methods for digital computers (v. 1 ; v. 2) Ralston, Anthony, Wilf, Herbert S., 1931- Wiley
6 図書 Mathematics for the physical sciences Wilf, Herbert S., 1931- John Wiley ; c1962	12 図書 Complexity of sequential and parallel numerical algorithms : proceedings Symposium on Complexity of Sequential and Parallel Numerical Algorithms, Traub, Joseph Frederick, 1932-, Carnegie-Mellon … Academic Press