Für diesen Artikel ist leider kein Bild verfügbar.

Combinatorics and Theoretical Computer Science

Proceedings of the Capital City Conference, Washington, DC, USA, 22-26 May 1989

R. Simion (Herausgeber)

Buch | Hardcover

296 Seiten

1992
Elsevier Science Ltd (Verlag)
978-0-444-89360-4 (ISBN)

Titel ist leider vergriffen;
keine Neuauflage

Artikel merken

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.

Erscheint lt. Verlag	5.2.1992
Reihe/Serie	Topics in Discrete Mathematics ; v. 1
Verlagsort	Oxford
Sprache	englisch
Themenwelt	Mathematik / Informatik ► Informatik ► Theorie / Studium
Themenwelt	Mathematik / Informatik ► Mathematik ► Graphentheorie
ISBN-10	0-444-89360-1 / 0444893601
ISBN-13	978-0-444-89360-4 / 9780444893604
Zustand	Neuware