LEADER 04324nam  22007695  450 
001 9910143592503321
005 20200706072617.0
010   $a3-540-45506-X
024 7 $a10.1007/3-540-45506-X
035   $a(CKB)1000000000211531
035   $a(SSID)ssj0000322017
035   $a(PQKBManifestationID)11231378
035   $a(PQKBTitleCode)TC0000322017
035   $a(PQKBWorkID)10299209
035   $a(PQKB)10225361
035   $a(DE-He213)978-3-540-45506-6
035   $a(MiAaPQ)EBC3072413
035   $a(PPN)155174304
035   $a(EXLCZ)991000000000211531
100   $a20121227d2001      u|         0
101 0 $aeng
135   $aurnn|008mamaa
181   $ctxt
182   $cc
183   $acr
200 10$aComputational Discrete Mathematics $eAdvanced Lectures /$fedited by Helmut Alt
205   $a1st ed. 2001.
210  1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d2001.
215   $a1 online resource (VII, 173 p.) 
225 1 $aLecture Notes in Computer Science,$x0302-9743 ;$v2122
300   $aBibliographic Level Mode of Issuance: Monograph
311   $a3-540-42775-9 
320   $aIncludes bibliographical references at the end of each chapters and index.
327   $aLattice 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.
330   $aThis 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.
410  0$aLecture Notes in Computer Science,$x0302-9743 ;$v2122
606   $aAlgorithms
606   $aComputer programming
606   $aComputer science?Mathematics
606   $aComputer graphics
606   $aCombinatorial analysis
606   $aAlgorithm Analysis and Problem Complexity$3https://scigraph.springernature.com/ontologies/product-market-codes/I16021
606   $aProgramming Techniques$3https://scigraph.springernature.com/ontologies/product-market-codes/I14010
606   $aMathematics of Computing$3https://scigraph.springernature.com/ontologies/product-market-codes/I17001
606   $aDiscrete Mathematics in Computer Science$3https://scigraph.springernature.com/ontologies/product-market-codes/I17028
606   $aComputer Graphics$3https://scigraph.springernature.com/ontologies/product-market-codes/I22013
606   $aCombinatorics$3https://scigraph.springernature.com/ontologies/product-market-codes/M29010
615  0$aAlgorithms.
615  0$aComputer programming.
615  0$aComputer science?Mathematics.
615  0$aComputer graphics.
615  0$aCombinatorial analysis.
615 14$aAlgorithm Analysis and Problem Complexity.
615 24$aProgramming Techniques.
615 24$aMathematics of Computing.
615 24$aDiscrete Mathematics in Computer Science.
615 24$aComputer Graphics.
615 24$aCombinatorics.
676   $a510
702   $aAlt$b Helmut$4edt$4http://id.loc.gov/vocabulary/relators/edt
801  0$bMiAaPQ
801  1$bMiAaPQ
801  2$bMiAaPQ
906   $aBOOK
912   $a9910143592503321
996   $aComputational discrete mathematics$9972209
997   $aUNINA