Combinatorics and theoretical computer science : proceedings of the Capital City Conference on Combinatorics and Theoretical Computer Science, Washington, DC, 1989
著者
書誌事項
Combinatorics and theoretical computer science : proceedings of the Capital City Conference on Combinatorics and Theoretical Computer Science, Washington, DC, 1989
（Topics in discrete mathematics, 1）
North-Holland , Sole distributors for the USA and Canada, Elsevier Science Pub. Co., 1992
大学図書館所蔵 件 / 全18件
-
該当する所蔵館はありません
- すべての絞り込み条件を解除する
注記
"Reprinted from the journal, Discrete applied mathematics, volume 34, numbers 1-3, 1991."
Includes bibliographical references (p. 285-287) and index
内容説明・目次
内容説明
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.
目次
Constructive Complexity (K. Abrahamson et al.). q-Functional Equations and Some Partition Identities (A.K. Agarwal). On doing Todd-Coxeter Coset Enumeration in Parallel (S. Akl et al.). The Mapmaker's Dilemma (R. Beigel, W.I. Gasarch). Computation of the Expected Number of Leaves in a Tree having a Given Automorphism, and related topics (F. Bergeron, G. Labelle, P. Leroux). Generalized Flags in Finite Abelian p -Groups (L.M. Butler). Threshold Functions for Local Properties of Graphs: Triangles (L.H. Clark, R.C. Entringer, L.A. Szekely). Brick Tabloids and the Connection Matrices between Bases of Symmetric Functions (O. Egecioglu, J.B. Remmel). Matchings and Cycle Covers in Random Digraphs (J. Gimbel, E.M. Palmer). Semigroup Automaton Structure by Homomorphism and Domain Partition (B. Greenblatt, W.R. Edwards Jr.). Linear and Nonlinear Inequalities concerning a certain Combinatorial Sequence which arises from Counting the Number of Chains of a Finite Distributive Lattice (T. Hibi). On a Unique Tree Representation for P 4 -Extendible Graphs (B. Jamison, S. Olariu). An Introduction to Randomized Algorithms (R.M. Karp). Improved Bounds for Harmonic-Based Bin Packing Algorithms (M.B. Richey). The Riordan Group (L.W. Shapiro et al.). Some Applications of Algebra to Combinatorics (R.P. Stanley). The Maximum Number of Winning 2-Sets (D.B. West). Reading List.
「Nielsen BookData」 より