Cantitate/Preț
Produs

Computational Discrete Mathematics: Advanced Lectures: Lecture Notes in Computer Science, cartea 2122

Editat de Helmut Alt
en Limba Engleză Paperback – 24 oct 2001
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.
Citește tot Restrânge

Din seria Lecture Notes in Computer Science

Preț: 31481 lei

Preț vechi: 39352 lei
-20% Nou

Puncte Express: 472

Preț estimativ în valută:
6025 6356$ 5021£

Carte tipărită la comandă

Livrare economică 02-16 ianuarie 25

Preluare comenzi: 021 569.72.76

Specificații

ISBN-13: 9783540427759
ISBN-10: 3540427759
Pagini: 188
Ilustrații: VII, 173 p.
Dimensiuni: 155 x 235 x 10 mm
Greutate: 0.27 kg
Ediția:2001
Editura: Springer Berlin, Heidelberg
Colecția Springer
Seria Lecture Notes in Computer Science

Locul publicării:Berlin, Heidelberg, Germany

Public țintă

Research

Cuprins

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.

Textul de pe ultima copertă

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.

Caracteristici

Includes supplementary material: sn.pub/extras