Author

Publication

2001-11-28 - Springer

Language

English

Word Count

43,250 words, Guess

Page Count

173 pages

Physical Format

Paperback

Identifiers

and 5 more
  • LibraryThing7805075
  • Library of Congress Control Number2001055072
  • OCLC Control Number48383521
  • Better World Books9783540427759
  • Open LibraryOL9492343M

Classifications

  • LCCQA39.3 .C66 2001
  • LCCQA75.5-76.95

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.

First Sentence

The essence of mathematics is proving theorems - and so, that is what mathematicians do: they prove theorems.

Subjects

Other Editions

  • Computational Discrete Mathematics: Advanced Lectures (Lecture Notes in Computer Science)PaperbackSpringer2001-11-28

Similar Books

Reader Reviews

No reviews yet for this book.

Be the first to share your thoughts!