\documentstyle[12pt]{article}
\pagestyle{empty}
\input{headerhack}
\setlength{\textwidth}{6in}
\setlength{\textheight}{8in}
\setlength{\evensidemargin}{0.25in}
\setlength{\oddsidemargin}{0.25in}
\setlength{\footskip}{.5in}
\setlength{\topmargin}{0.0in}
\renewcommand{\baselinestretch}{1.0}
\setlength{\parskip}{2\parskip plus 2pt minus 1pt}
\begin{document}

\doheading{2}{title}{Last Revised: September, 1993}
\htitle{Introduction to Discrete Applied Mathematics}

\begin{center}
\Large
Table of Contents
\normalsize
\end{center}

\noindent
I. Weighing and Sorting

1. Weighing Problems

2. Sorting

3. Finding the Median in a Linear Number of Steps

4. Batcher's Algorithm

\noindent
II. Coding (with a review of Probability)

1. How Efficiently Can We Code?

2. Alphabetical Coding and the Hu-Tucker Algorithm

3. Review of Probability

4. Coding for Error Correction

\noindent
III. Linear Codes

1. Linear Codes

2. Polynomial Codes

3. BCH Codes and Their Correction

4. Error-Correcting Codes, Additional Comments

\noindent
IV. Secret Codes

1. About Public Key Cryptosystems

2. Review of Algebra

3. The RSA Coding Scheme

4. Factoring Large Numbers

\noindent
V. Generating Functions / Fast Arithmetic

1. Recurrence Relations

2. Impedance of Networks

4. Multiplying Numbers Quickly

5. Matrix Multiplication

\noindent
VI. Linear Programming I and Games

1. Introduction

2. The Simplex Algorithm

3. The Algebraic Formulation

4. Feasibility

5. Duality

6. Two Person Games and Competition in Economics

\noindent
VII. Linear Programming II

1. How good is the Simplex Algorithm?

2. The Ellipsoid Algorithm for Linear Programming

3. Karmarkar's algorithm for linear programming

\end{document}

