Combinatorics and Theoretical Computer Science: Proceedings of the Capital City Conference on Combinatorics and Theoretical Computer Science, Washington, DC, 1989
North-Holland, 1992 - Mathematics - 290 pages
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.
What people are saying - Write a review
We haven't found any reviews in the usual places.
COMBINATORICS AND THEORETICAL COMPUTER SCIENCE
A K Agarwal
ft Beigeland W I Gasarch
9 other sections not shown
A-brick tabloids A:-coloring adjacent antichain B.V. All rights bins bipartite graphs coefficients cographs Cohen-Macaulay coloring combinatorial Computer Science conjecture constraints construction corresponding cycle index cycle index series defined definition denote elements equations example exists expected number extension set Ferrers diagram formula given graph G harmonic Hence Hilbert function identity inducing a P4 input semigroup integer isomorphic k-coloring Kostka polynomials lattice Lemma linear Mapmaker Math matrix monoid nodes nonnegative NP-complete obtained oracle complexity order matching p-group P4 in G P4-extendible graphs packed pair parallel perfect matching performance bound permutation polynomial polynomial-time poset problem proof prove randomized algorithms range size preserving rank unimodal result rooted trees Science Publishers B.V. semigroup semigroup automaton sequence simplicial complex simplicial polytope species spheres strings structure subgraph subgroups subsets subspace symmetric functions Theorem theory tion treap triangle-free triangulation undef unimodal vector space vertex w-vector winning sets