Online Public Access Catalogue (OPAC)
Library,Documentation and Information Science Division

“A research journal serves that narrow

borderland which separates the known from the unknown”

-P.C.Mahalanobis


Normal view MARC view ISBD view

Building Bridges [electronic resource] : Between Mathematics and Computer Science / edited by Martin Grötschel, Gyula O. H. Katona, Gábor Sági.

Contributor(s): Grötschel, Martin [editor.] | Katona, Gyula O. H [editor.] | Sági, Gábor [editor.] | SpringerLink (Online service).
Material type: TextTextSeries: Bolyai Society Mathematical Studies: 19Publisher: Berlin, Heidelberg : Springer Berlin Heidelberg, 2008Description: 595 p. online resource.Content type: text Media type: computer Carrier type: online resourceISBN: 9783540852216.Subject(s): Combinatorics | Information theory | Number theory | Electronic data processing | Computational complexity | Combinatorics | Discrete Mathematics | Theory of Computation | Number Theory | Numeric Computing | Discrete Mathematics in Computer ScienceAdditional physical formats: Printed edition:: No title; Printed edition:: No title; Printed edition:: No titleDDC classification: 511.6 Online resources: Click here to access online
Contents:
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.
In: Springer eBooksSummary: 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.
Tags from this library: No tags from this library for this title. Log in to add tags.
Item type Current location Call number Status Date due Barcode Item holds
E-BOOKS E-BOOKS ISI Library, Kolkata
 
Available EB1416
Total holds: 0

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.

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.

There are no comments for this item.

Log in to your account to post a comment.
Library, Documentation and Information Science Division, Indian Statistical Institute, 203 B T Road, Kolkata 700108, INDIA
Phone no. 91-33-2575 2100, Fax no. 91-33-2578 1412, ksatpathy@isical.ac.in


Visitor Counter