Building Bridges : Between Mathematics and 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...

Full description

Corporate Author: SpringerLink (Online service)
Other Authors: Grötschel, Martin (Editor), Katona, Gyula O.H. (Editor)
Format: eBook
Language:English
Published: Berlin, Heidelberg Springer Berlin Heidelberg 2008, 2008
Edition:1st ed. 2008
Series:Bolyai Society Mathematical Studies
Subjects:
Online Access:
Collection: Springer eBooks 2005- - Collection details see MPG.ReNa
LEADER 03236nmm a2200421 u 4500
001 EB000380828
003 EBX01000000000000000233880
005 00000000000000.0
007 cr|||||||||||||||||||||
008 130626 ||| eng
020 |a 9783540852216 
100 1 |a Grötschel, Martin  |e [editor] 
245 0 0 |a Building Bridges  |h Elektronische Ressource  |b Between Mathematics and Computer Science  |c edited by Martin Grötschel, Gyula O.H. Katona 
250 |a 1st ed. 2008 
260 |a Berlin, Heidelberg  |b Springer Berlin Heidelberg  |c 2008, 2008 
300 |a 595 p  |b online resource 
505 0 |a 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 
653 |a Computer science—Mathematics 
653 |a Discrete Mathematics 
653 |a Theory of Computation 
653 |a Number theory 
653 |a Number Theory 
653 |a Computers 
653 |a Numerical analysis 
653 |a Numeric Computing 
653 |a Discrete mathematics 
653 |a Combinatorics 
653 |a Discrete Mathematics in Computer Science 
653 |a Combinatorics 
700 1 |a Katona, Gyula O.H.  |e [editor] 
710 2 |a SpringerLink (Online service) 
041 0 7 |a eng  |2 ISO 639-2 
989 |b Springer  |a Springer eBooks 2005- 
490 0 |a Bolyai Society Mathematical Studies 
856 |u https://doi.org/10.1007/978-3-540-85221-6?nosfx=y  |x Verlag  |3 Volltext 
082 0 |a 511.6 
520 |a 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 many other areas is László Lovász, a scholar whose outstanding scientific work has defined and shaped many research directions in the last 40 years. A number of friends and colleagues, all top authorities in their fields of expertise and all invited plenary speakers at one of two conferences in August 2008 in Hungary, both celebrating Lovász’s 60th birthday, have contributed their latest research papers to this volume. This collection of articles offers an excellent view on the state of combinatorics and related topics and will be of interest for experienced specialists as well as young researchers