The use of statistical methods in the design and analysis of discrete algorithms is explored. The introductory chapter contains a literature survey and background material on probability theory. In Chapter 2, probabilistic approximation algorithms are discussed with the goal of exposing and correcting some oversights in previous work. Chapter 3…

Summarizes a simple design algorithm which identifies nested loops of equations which must be solved by trial-and-error methods. The algorithm is designed to minimize such loops, provides guidance to the selection of variables, and delineates the order in which systems of equations are to be solved. Examples are included. (TW)