Computational Discrete Mathematics

Advanced Lectures

AvHelmut Alt

Häftad, Engelska, 2001

Del i serien Lecture Notes in Computer Science

562 kr

Beställningsvara. Skickas inom 10-15 vardagar. Fri frakt över 249 kr.

Beskrivning

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.

Produktinformation

Utgivningsdatum:2001-10-24
Mått:155 x 235 x 11 mm
Vikt:295 g
Format:Häftad
Språk:Engelska
Serie:Lecture Notes in Computer Science
Antal sidor:173
Upplaga:2001
Förlag:Springer-Verlag Berlin and Heidelberg GmbH & Co. KG
ISBN:9783540427759

Utforska kategorier

Systemvetenskap och AI inom Data och IT
Programmeringsböcker inom Data och IT

Innehållsförteckning

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.