Matches in Harvard for { <http://id.lib.harvard.edu/aleph/008899588/catalog> ?p ?o. }
Showing items 1 to 28 of
28
with 100 items per page.
- catalog abstract "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.".
- catalog contributor b12495124.
- catalog created "2001.".
- catalog date "2001".
- catalog date "2001.".
- catalog dateCopyrighted "2001.".
- catalog description "Includes bibliographical references.".
- catalog description "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.".
- catalog description "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.".
- catalog extent "vi, 171 p. :".
- catalog identifier "3540427759 (pbk. : acid-free paper)".
- catalog isPartOf "Lecture notes in computer science, 0302-9743 ; 2122".
- catalog issued "2001".
- catalog issued "2001.".
- catalog language "eng".
- catalog publisher "Berlin ; New York : Springer,".
- catalog subject "510 21".
- catalog subject "Combinatorics.".
- catalog subject "Computational complexity.".
- catalog subject "Computer graphics.".
- catalog subject "Computer science Mathematics.".
- catalog subject "Computer science.".
- catalog subject "Computer software.".
- catalog subject "Mathematics.".
- catalog subject "QA39.3 .C66 2001".
- catalog tableOfContents "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.".
- catalog title "Computational discrete mathematics : advanced lectures / Helmut Alt (ed.).".
- catalog type "text".