Computational complexity theory is the study of the quantitative laws that govern computing. This book contains the proceedings of the AMS Short Course on Computational Complexity Theory, held at the Joint Mathematics Meetings in Atlanta in January 1988.
Features lectures that require a background in the methodologies of discrete mathematics, in particular the elements of algebra, combinatorics and graph theory,... Læs mere
Computer communications is characterized by rapid technological advances presenting problems of a theoretical nature that are often very difficult to solve. This title... Læs mere
The theory of networks is a very lively one, both in terms of developments in the theory itself and of the variety of its applications. This book, based on the 1981 AMS Short... Læs mere
Contains lectures that emphasize specific areas of operations research and the mathematics used in modeling and solving the related problems.
Contains papers of the outstanding and versatile mathematician, Witold Hurewicz. This title covers set theory and dimension. It also covers his work in algebraic... Læs mere
The collected works of A. Adrian Albert, a leading algebraist of the twentieth century. Part 1 focuses on associative algebras and Riemann... Læs mere