Computational Discrete Mathematics Advanced Lectures /

• Συγγραφή απο Οργανισμό/Αρχή: SpringerLink (Online service)
• Άλλοι συγγραφείς: Alt, Helmut (Επιμελητής έκδοσης, http://id.loc.gov/vocabulary/relators/edt)
• Μορφή: Ηλεκτρονική πηγή Ηλ. βιβλίο
• Γλώσσα: English
• Έκδοση: Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2001.
• Έκδοση: 1st ed. 2001.
• Σειρά: Lecture Notes in Computer Science, 2122
• Θέματα: Algorithms.; Computer programming.; Computer science-Mathematics.; Computer graphics.; Combinatorics.; Algorithm Analysis and Problem Complexity.; Programming Techniques.; Mathematics of Computing.; Discrete Mathematics in Computer Science.; Computer Graphics.

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 math...

Πίνακας περιεχομένων:

• 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.