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…

This thesis addresses problems from two areas of theoretical computer science. The first area is that of computational learning theory, which is the study of the phenomenon of concept learning using formal mathematical models. The goal of computational learning theory is to investigate learning in a rigorous manner through the use of techniques…

When problems defy solution, mathematicians can settle for "almost." This branch of mathematics (called computational complexity) encompasses both the number of parts involved in a problem and the intricacy of their interrelatedness. Current research in this area is discussed, considering various computer applications involved. (JN)

This SMSG study guide is designed to aid the teacher in acquiring familiarity with digital computer concepts or to further his/her knowledge of the field. Suitable references for important topics are categorized as central, peripheral, or advanced. Topics covered include: (1) nature and organization of computers; (2) problem analysis; (3)…

Describes the nature and use of computer algebra and its applications to various physical sciences. Includes diagrams illustrating, among others, a computer algebra system and flow chart of operation of the Euclidean algorithm. (SK)

Presented is a scheduling algorithm that uses all the busses at each step for any rectangular array. Included are two lemmas, proofs, a theorem, the solution, and variations on this problem. (KR)