Find a copy online
Links to this item
link.springer-ny.com Restricted to Springer LINK subscribers
Find a copy in the library
Finding libraries that hold this item...
Details
| Material Type: | Internet resource |
|---|---|
| Document Type: | Book, Internet Resource |
| All Authors / Contributors: |
Helmut Alt |
| ISBN: | 3540427759 9783540427759 |
| OCLC Number: | 48383521 |
| Description: | vi, 171 p. : ill. ; 24 cm. |
| Contents: | Lattice paths and determinants / Martin Aigner -- The nearest neighbor / Helmut Alt -- Explicit and implicit enforcing - randomized optimization / Bernd Gärtner and Emo Welzl -- Codes over Z₄ / Tor Helleseth -- Degree bounds for long paths and cycles in k-connected graphs / Heinz Adolf Jung -- Data strucutres for Boolean functions / Christoph Meinel and Christian Stangier -- Scheduling under uncertainty : bounding the makespan distribution / Rolf H. Möhring -- Random graphs, random triangle-free graphs, and random partial orders / Hans Jürgen Prömel and Anusch Taraz -- Division-free algorithms for the determinant and the Pfaffian : algebraic and combinatorial approaches / Günter Rote -- Check character systems and anti-symmetric mappings / Ralph-Hardo Schulz -- Algorithms in pure mathematics / Gernot Stroth -- Coloring Hamming graphs, optimal binary codes, and the 0/1-Borsuk problem in low dimensions / Günter M. Ziegler. |
| Series Title: | Lecture notes in computer science, 2122 |
| Responsibility: | Helmut Alt (ed.). |
| More information: |
Reviews
Add a review and share your thoughts with other readers.
Be the first.
Add a review and share your thoughts with other readers.
Be the first.
Tags
Add tags for "Computational discrete mathematics : advanced lectures".
Be the first.
