04324nam 22007695 450 991014359250332120200706072617.03-540-45506-X10.1007/3-540-45506-X(CKB)1000000000211531(SSID)ssj0000322017(PQKBManifestationID)11231378(PQKBTitleCode)TC0000322017(PQKBWorkID)10299209(PQKB)10225361(DE-He213)978-3-540-45506-6(MiAaPQ)EBC3072413(PPN)155174304(EXLCZ)99100000000021153120121227d2001 u| 0engurnn|008mamaatxtccrComputational Discrete Mathematics Advanced Lectures /edited by Helmut Alt1st ed. 2001.Berlin, Heidelberg :Springer Berlin Heidelberg :Imprint: Springer,2001.1 online resource (VII, 173 p.) Lecture Notes in Computer Science,0302-9743 ;2122Bibliographic Level Mode of Issuance: Monograph3-540-42775-9 Includes bibliographical references at the end of each chapters and index.Lattice Paths and Determinants -- The Nearest Neighbor -- Explicit and Implicit Enforcing - Randomized Optimization -- Codes over Z 4 -- Degree Bounds for Long Paths and Cycles in k-Connected Graphs -- Data Structures for Boolean Functions BDDs — Foundations and Applications -- Scheduling under Uncertainty: Bounding the Makespan Distribution -- Random Graphs, Random Triangle-Free Graphs, and Random Partial Orders -- Division-Free Algorithms for the Determinant and the Pfaffian: Algebraic and Combinatorial Approaches -- Check Character Systems and Anti-symmetric Mappings -- Algorithms in Pure Mathematics -- Coloring Hamming Graphs, Optimal Binary Codes, and the 0/1-Borsuk Problem in Low Dimensions.This book is based on a graduate education program on computational discrete mathematics run for several years in Berlin, Germany as a joint effort of theoretical computer scientists and mathematicians in order to support doctoral students and advanced ongoing education in the field of discrete mathematics and algorithmics. The 12 selected lectures by leading researchers presented in this book provide recent research results and advanced topics in a coherent and consolidated way. Among the areas covered are combinatorics, graph theory, coding theory, discrete and computational geometry, optimization, and algorithmic aspects of algebra.Lecture Notes in Computer Science,0302-9743 ;2122AlgorithmsComputer programmingComputer science—MathematicsComputer graphicsCombinatorial analysisAlgorithm Analysis and Problem Complexityhttps://scigraph.springernature.com/ontologies/product-market-codes/I16021Programming Techniqueshttps://scigraph.springernature.com/ontologies/product-market-codes/I14010Mathematics of Computinghttps://scigraph.springernature.com/ontologies/product-market-codes/I17001Discrete Mathematics in Computer Sciencehttps://scigraph.springernature.com/ontologies/product-market-codes/I17028Computer Graphicshttps://scigraph.springernature.com/ontologies/product-market-codes/I22013Combinatoricshttps://scigraph.springernature.com/ontologies/product-market-codes/M29010Algorithms.Computer programming.Computer science—Mathematics.Computer graphics.Combinatorial analysis.Algorithm Analysis and Problem Complexity.Programming Techniques.Mathematics of Computing.Discrete Mathematics in Computer Science.Computer Graphics.Combinatorics.510Alt Helmutedthttp://id.loc.gov/vocabulary/relators/edtMiAaPQMiAaPQMiAaPQBOOK9910143592503321Computational discrete mathematics972209UNINA