Learn IT - Books tags combinatorics

Probabilistic Group Theory, Combinatorics, and Computing: Lectures from the Fifth de Brún Workshop (Lecture Notes in Mathematics)

Springer, 2013

Probabilistic Group Theory, Combinatorics and Computing is based on lecture courses held at the Fifth de Brún Workshop in Galway, Ireland in April 2011. Each course discusses computational and algorithmic aspects that have recently emerged at the interface of group theory and combinatorics, with a strong focus on probabilistic methods...

Finite Model Theory and Its Applications (Texts in Theoretical Computer Science. An EATCS Series)

Springer, 2007

This book gives a comprehensive overview of central themes of finite model theory expressive power, descriptive complexity, and zero-one laws together with selected applications relating to database theory and artificial intelligence, especially constraint databases and constraint satisfaction problems. The final chapter provides a concise modern...

From Erdos to Kiev: Problems of Olympiad Caliber (Dolciani Mathematical Expositions)

The Mathematical Association of America, 1997

'The publication of every new volume in The Dolciani Mathematical Expositions of the Mathematical Association of America is an important event ... This book is recommended to teachers, students and everyone, who enjoy the fun and games of problem solving and have the opinion that asking and answering problems is what keeps a mathematician young in...

$The Math Problems Notebook$

The Math Problems Notebook

Birkhauser, 2007

The Math Problems Notebook is a collection of nontrivial, unconventional problems requiring deep insight and imagination reminiscent of those discussed at Sunday Math Circles. These circles have become a place for disseminating beautiful mathematics at an elementary level for college students who have a common passion for mathematics....

Probabilistic Methods for Algorithmic Discrete Mathematics (Algorithms and Combinatorics)

Springer, 1998

The book gives an accessible account of modern probabilistic methods for analyzing combinatorial structures and algorithms. It will be an useful guide for graduate students and researchers.
Special features included: a simple treatment of Talagrand's inequalities and their applications; an overview and many carefully worked out examples of the...

Complex Analysis (Princeton Lectures in Analysis, No. 2)

Princeton Press, 2003

With this second volume, we enter the intriguing world of complex analysis. From the first theorems on, the elegance and sweep of the results is evident. The starting point is the simple idea of extending a function initially given for real values of the argument to one that is defined when the argument is complex. From there, one proceeds to...

Graph Theory, Combinatorics and Algorithms: Interdisciplinary Applications (Operations Research / Computer Science Interfaces Series)

Springer, 2005

Graph Theory, Combinatorics and Algorithms: Interdisciplinary Applications focuses on discrete mathematics and combinatorial algorithms interacting with real world problems in computer science, operations research, applied mathematics and engineering. The book contains eleven chapters written by...

Mathematics and Computer Science: Algorithms, Trees, Combinatorics and Probabilities (Trends in Mathematics)

Birkhauser, 2000

This is the first book where mathematics and computer science are directly confronted and joined to tackle intricate problems in computer science with deep mathematical approaches. It contains a collection of refereed papers presented at the Colloquium on Mathematics and Computer Science held at the University of Versailles-St-Quentin on...

Introduction to Chemical Graph Theory (Discrete Mathematics and Its Applications)

CRC Press, 2018

Introduction to Chemical Graph Theory is a concise introduction to the main topics and techniques in chemical graph theory, specifically the theory of topological indices. These include distance-based, degree-based, and counting-based indices. The book covers some of the most commonly used mathematical...

An Invitation to Analytic Combinatorics: From One to Several Variables (Texts & Monographs in Symbolic Computation)

Springer, 2020

This book uses new mathematical tools to examine broad computability and complexity questions in enumerative combinatorics, with applications to other areas of mathematics, theoretical computer science, and physics. A focus on effective algorithms leads to the development of computer algebra software of use...

Sparsity: Graphs, Structures, and Algorithms (Algorithms and Combinatorics)

Springer, 2014

This book offers a systematic study of sparse graphs and sparse finite structures. Although the notion of sparsity appears in various contexts and is typical of a fuzzy notion, the authors present a unifying classification of general classes of structures....

Discrete Mathematics

Springer, 2003

Discrete mathematics is quickly becoming one of the most important areas of mathematical research, with applications to cryptography, linear programming, coding theory and the theory of computing. This book is aimed at undergraduate mathematics and computer science students interested in developing a feeling for what mathematics is all about,...

Result Page: 7 6 5 4 3 2 1