Computational Discrete Mathematics
Editat de Helmut Alten Limba Engleză Paperback – 24 oct 2001
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.
Preț: 316.44 lei
Preț vechi: 395.55 lei
-20%
Puncte Express: 475
Preț estimativ în valută:
55.91€ • 64.81$ • 48.76£
55.91€ • 64.81$ • 48.76£
Carte tipărită la comandă
Livrare economică 15-29 mai
Specificații
ISBN-13: 9783540427759
ISBN-10: 3540427759
Pagini: 188
Ilustrații: VII, 173 p.
Dimensiuni: 155 x 235 x 11 mm
Greutate: 0.3 kg
Ediția:2001
Editura: Springer
Locul publicării:Berlin, Heidelberg, Germany
ISBN-10: 3540427759
Pagini: 188
Ilustrații: VII, 173 p.
Dimensiuni: 155 x 235 x 11 mm
Greutate: 0.3 kg
Ediția:2001
Editura: Springer
Locul publicării:Berlin, Heidelberg, Germany
V-ar putea interesa
-
Weapons of Math DestructionCathy O'Neil-32%Preț: 59.85 lei88.41 lei -
An Introduction to Quantum ComputingPhillip Kaye-23%Preț: 417.70 lei540.40 lei -
-27%Preț: 343.56 lei468.04 lei -
Algorithmic PuzzlesAnany Levitin-32%Preț: 222.42 lei325.10 lei -
Algorithms UnlockedThomas H. Cormen-27%Preț: 181.37 lei248.84 lei -
Concentration of Measure for the Analysis of Randomized AlgorithmsDevdatt P. Dubhashi-20%Preț: 306.07 lei382.59 lei -
-9%Preț: 843.32 lei926.73 lei -
-20%Preț: 300.78 lei375.97 lei -
Applications of Evolutionary ComputationGiovanni Squillero-20%Preț: 320.50 lei400.63 lei -
Digital Logic for ComputingJohn Seiffertt-20%Preț: 487.41 lei609.27 lei -
Algorithmic Aspects of Cloud ComputingTimos Sellis-20%Preț: 316.83 lei396.04 lei -
Algorithms and ComplexityDimitris Fotakis-20%Preț: 332.81 lei416.02 lei -
Preț: 394.58 lei -
STACS 2003Helmut Alt-20%Preț: 645.59 lei806.98 lei -
STACS 2002Helmut Alt-20%Preț: 643.34 lei804.18 lei -
Taschenbuch der AlgorithmenBerthold Vöcking-20%Preț: 275.50 lei344.38 lei -
Efficient AlgorithmsSusanne Albers-20%Preț: 330.15 lei412.69 lei -
Algorithms UnpluggedBerthold Vöcking-24%Preț: 659.67 lei867.99 lei -
Computing and CombinatoricsBin Fu-20%Preț: 340.80 lei426.01 lei -
-20%Preț: 346.38 lei432.97 lei -
-20%Preț: 329.74 lei412.17 lei -
-20%Preț: 401.78 lei502.22 lei -
-20%Preț: 400.70 lei500.88 lei -
-20%Preț: 340.84 lei426.05 lei -
-20%Preț: 324.99 lei406.23 lei -
-20%Preț: 729.28 lei911.60 lei -
Algorithmics of Matching Under PreferencesDavid Manlove-20%Preț: 1068.15 lei1335.19 lei
Public țintă
ResearchCuprins
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.
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