Übersicht			Auf mobile öffnen

Lieferstatus:	i.d.R. innert 5-10 Tagen versandfertig
Veröffentlichung:	Oktober 2001
Genre:	Schulbücher
	algorithmanalysisandproblemcomplexity / Algorithmen und Datenstrukturen / Algorithms / Coding / codingtheory / Combinatorics / computationalalgebra / ComputationalAlgorithms / computationalgeometry / computationalmathematics / Computer / datastructures / DiscreteMathematics / Diskret (mathematisch) / Diskrete Mathematik / geometry / Grafikprogrammierung / Graph - Graphentheorie / graphcomputations / Mapping / Mathematik / Höhere Mathematik / randomization mehr...
ISBN:	9783540427759
EAN-Code:	9783540427759
Verlag:	Springer
Einband:	Kartoniert
Sprache:	English
Serie:	#2122 - Lecture Notes in Computer Science
Dimensionen:	H 235 mm / B 155 mm / D 11 mm
Gewicht:	295 gr
Seiten:	188
Bewertung:	Titel bewerten / Meinung schreiben

Inhalt:

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.