000 | 03138nam a22005295i 4500 | ||
---|---|---|---|
001 | 978-3-540-45506-6 | ||
003 | DE-He213 | ||
005 | 20160624102003.0 | ||
007 | cr nn 008mamaa | ||
008 | 121227s2001 gw | s |||| 0|eng d | ||
020 |
_a9783540455066 _9978-3-540-45506-6 |
||
024 | 7 |
_a10.1007/3-540-45506-X _2doi |
|
050 | 4 | _aQA76.9.A43 | |
072 | 7 |
_aUMB _2bicssc |
|
072 | 7 |
_aCOM051300 _2bisacsh |
|
082 | 0 | 4 |
_a005.1 _223 |
245 | 1 | 0 |
_aComputational Discrete Mathematics _h[electronic resource] : _bAdvanced Lectures / _cedited by Helmut Alt. |
260 | 1 |
_aBerlin, Heidelberg : _bSpringer Berlin Heidelberg, _c2001. |
|
264 | 1 |
_aBerlin, Heidelberg : _bSpringer Berlin Heidelberg, _c2001. |
|
300 |
_aVII, 173 p. _bonline resource. |
||
336 |
_atext _btxt _2rdacontent |
||
337 |
_acomputer _bc _2rdamedia |
||
338 |
_aonline resource _bcr _2rdacarrier |
||
347 |
_atext file _bPDF _2rda |
||
490 | 1 |
_aLecture Notes in Computer Science, _x0302-9743 ; _v2122 |
|
505 | 0 | _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. | |
520 | _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. | ||
650 | 0 | _aComputer science. | |
650 | 0 | _aComputer software. | |
650 | 0 | _aComputational complexity. | |
650 | 0 | _aComputer graphics. | |
650 | 0 | _aCombinatorics. | |
650 | 1 | 4 | _aComputer Science. |
650 | 2 | 4 | _aAlgorithm Analysis and Problem Complexity. |
650 | 2 | 4 | _aDiscrete Mathematics in Computer Science. |
650 | 2 | 4 | _aComputer Graphics. |
650 | 2 | 4 | _aCombinatorics. |
700 | 1 |
_aAlt, Helmut. _eeditor. |
|
710 | 2 | _aSpringerLink (Online service) | |
773 | 0 | _tSpringer eBooks | |
776 | 0 | 8 |
_iPrinted edition: _z9783540427759 |
786 | _dSpringer | ||
830 | 0 |
_aLecture Notes in Computer Science, _x0302-9743 ; _v2122 |
|
856 | 4 | 0 | _uhttp://dx.doi.org/10.1007/3-540-45506-X |
942 |
_2EBK5419 _cEBK |
||
999 |
_c34713 _d34713 |