Greek
Computational Discrete Mathematics
Overview of attention for book
Table of Contents
-
Altmetric BadgeBook Overview
-
Altmetric BadgeChapter 1 Lattice Paths and Determinants
-
Altmetric BadgeChapter 2 The Nearest Neighbor
-
Altmetric BadgeChapter 3 Explicit and Implicit Enforcing - Randomized Optimization
-
Altmetric BadgeChapter 4 Codes over Z 4
-
Altmetric BadgeChapter 5 Degree Bounds for Long Paths and Cycles in k-Connected Graphs
-
Altmetric BadgeChapter 6 Data Structures for Boolean Functions BDDs — Foundations and Applications
-
Altmetric BadgeChapter 7 Scheduling under Uncertainty: Bounding the Makespan Distribution
-
Altmetric BadgeChapter 8 Random Graphs, Random Triangle-Free Graphs, and Random Partial Orders
-
Altmetric BadgeChapter 9 Division-Free Algorithms for the Determinant and the Pfaffian: Algebraic and Combinatorial Approaches
-
Altmetric BadgeChapter 10 Check Character Systems and Anti-symmetric Mappings
-
Altmetric BadgeChapter 11 Algorithms in Pure Mathematics
-
Altmetric BadgeChapter 12 Coloring Hamming Graphs, Optimal Binary Codes, and the 0/1-Borsuk Problem in Low Dimensions
Altmetric Badge
Citations
- dimensions_citation
- 7 Dimensions