Building Bridges Between Mathematics and Computer Science /

• Συγγραφή απο Οργανισμό/Αρχή: SpringerLink (Online service)
• Άλλοι συγγραφείς: Grötschel, Martin (Επιμελητής έκδοσης), Katona, Gyula O. H. (Επιμελητής έκδοσης), Sági, Gábor (Επιμελητής έκδοσης)
• Μορφή: Ηλεκτρονική πηγή Ηλ. βιβλίο
• Γλώσσα: English
• Έκδοση: Berlin, Heidelberg : Springer Berlin Heidelberg, 2008.
• Σειρά: Bolyai Society Mathematical Studies, 19
• Θέματα: Mathematics.; Computers.; Numerical analysis.; Computer science > Mathematics.; Number theory.; Discrete mathematics.; Combinatorics.; Discrete Mathematics.; Theory of Computation.; Number Theory.; Numeric Computing.; Discrete Mathematics in Computer Science.

Discrete mathematics and theoretical computer science are closely linked research areas with strong impacts on applications and various other scientific disciplines. Both fields deeply cross fertilize each other. One of the persons who particularly contributed to building bridges between these and m...

Πίνακας περιεχομένων:

• On the Power of Linear Dependencies
• Surplus of Graphs and the Lovász Local Lemma
• Deformable Polygon Representation and Near-Mincuts
• Variations for Lovász’ Submodular Ideas
• Random Walks, Arrangements, Cell Complexes, Greedoids, and Self-Organizing Libraries
• The Finite Field Kakeya Problem
• An Abstract Szemerédi Regularity Lemma
• Isotropic PCA and Affine-Invariant Clustering
• Small Linear Dependencies for Binary Vectors of Low Weight
• Plünnecke’s Inequality for Different Summands
• Decoupling and Partial Independence
• Combinatorial Problems in Chip Design
• Structural Properties of Sparse Graphs
• Recent Progress in Matching Extension
• The Structure of the Complex of Maximal Lattice Free Bodies for a Matrix of Size (n + 1) × n
• Graph Invariants in the Edge Model
• Incidences and the Spectra of Graphs
• The Maturation of the Probabilistic Method
• A Structural Approach to Subset-Sum Problems.