Computational discrete mathematics : advanced lectures
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...
Shranjeno v:
| Glavni avtor: | |
|---|---|
| Format: | Livre numérique |
| Jezik: | Anglais |
| Izdano: |
Berlin [etc.] :
Springer
[20..].
Cham : Springer Nature |
| Serija: | Lecture notes in computer science
2122 |
| Teme: | |
| Online dostop: | Accès sur la plateforme de l'éditeur Accès sur la plateforme Istex Accès Université d'Orléans Accès INSA CVL |
| Sporočilo: |
Archives Springer e-books (Licence nationale) Archives Springer e-books (Licence nationale) |
| Autres localisations: | Voir dans le Sudoc |
| Edition sous un autre format: | • Computational discrete mathematics, advanced lectures, Helmut Alt (ed.), New York, Springer, 2001, 1 vol. (VI-171 p.), Lecture notes in computer science, 3-540-42775-9 • Computational Discrete Mathematics, Texte imprimé, 9783662194492 |
Kazalo:
- 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.