Important connections between Theoretical Computer Science and Combinatorics have been shown by advances in both fields resulting from cross-boundary collaborations and the awareness of problems and techniques specific to both fields. The publication of this volume - the first in the series Topics in Discrete Mathematics - allows a wide audience to appreciate the wealth of beautiful results, the power of the techniques, the excitement of open problems and prospective developments in several aspects of both fields. Included are surveys written in a style which bears in mind both the interests of the specialist and non-specialist. The list of recommended reading may encourage interested readers to pursue the study of the topics in depth.Proceedings of the Capital City Conference on Combinatorics and Theoretical Computer Science, Washington, DC, 1989 Rodica Simion. Definition 2.1. A decision problem is a pair Tl=(I, M), where M is a checker and / is the set of aquot;yesaquot;anbsp;...
|Title||:||Combinatorics and Theoretical Computer Science|
|Publisher||:||North Holland - 1992|