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 . It may be taken at no charge by all interested persons. Comments and corrections are welcome, and should be sent to
[email protected]
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 1.2 1.3 1.4 1