Learn IT - Books tags combinatorics

Matrices and Matroids for Systems Analysis (Algorithms and Combinatorics)

Springer, 2009

A matroid is an abstract mathematical structure that captures combinatorial properties of matrices. This book offers a unique introduction to matroid theory, emphasizing motivations from matrix theory and applications to systems analysis.
This book serves also as a comprehensive presentation of the theory and application of mixed...

Graph Theory: A Problem Oriented Approach (Mathematical Association of America Textbooks)

The Mathematical Association of America, 2008

Graph Theory presents a natural, reader-friendly way to learn some of the essential ideas of graph theory starting from first principles. The format is similar to the companion text, Combinatorics: A Problem Oriented Approach also by Daniel A. Marcus, in that it combines the features of a textbook with those of a problem...

How to Think About Algorithms

Cambridge University Press, 2008

There are many algorithm texts that provide lots of well-polished code and proofs of correctness. This book is not one of them. Instead, this book presents insights, notations, and analogies to help the novice describe and think about algorithms like an expert. By looking at both the big picture and easy step-by-step methods for developing...

Discrete Mathematics for Computer Science

Brooks Cole, 2005

As the discipline of computer science has matured, it has become clear that a study of discrete mathematical topics is an essential part of the computer science major. The course in discrete structures has two primary aims. The first is to introduce students to the rich mathematical structures that naturally describe much of the content of...

Combinatorial Optimization: Theory and Algorithms (Algorithms and Combinatorics)

Springer, 2012

This comprehensive textbook on combinatorial optimization places special emphasis on theoretical results and algorithms with provably good performance, in contrast to heuristics. It is based on numerous courses on combinatorial optimization and specialized topics, mostly at graduate level. This book reviews the...

Thinking in Problems: How Mathematicians Find Creative Solutions

Birkhauser, 2013

This concise, self-contained textbook gives an in-depth look at problem-solving from a mathematician’s point-of-view. Each chapter builds off the previous one, while introducing a variety of methods that could be used when approaching any given problem. Creative thinking is the key to solving mathematical problems, and this book...

Simulated Annealing and Boltzmann Machines: A Stochastic Approach to Combinatorial Optimization and Neural Computing

John Wiley & Sons, 1989

Wiley-Interscience Series in Discrete Mathematics and Optimization Advisory Editors Ronald L. Graham Jan Karel Lenstra Robert E. Tarjan Discrete Mathematics and Optimization involves the study of finite structures. It is one of the fastest growing areas in mathematics today. The level and depth of recent advances in the area and the wide...

Fundamental Approach to Discrete Mathematics

New Age Publications, 2009

The salient features of this book include: strong coverage of key topics involving recurrence relation, combinatorics, Boolean algebra, graph theory and fuzzy set theory. Algorithms and examples integrated throughout the book to bring clarity to the fundamental concepts. Each concept and definition is followed by thoughtful examples. There is...

Discrete Geometry for Computer Imagery: 15th IAPR International Conference, DGCI 2009, Montréal, Canada, September 30 - October 2, 2009, Proceedings

Springer, 2009

Held for the ?rst time outside Europe, the 15th International Conference on DiscreteGeometryforComputer ImagerytookplaceinMontr' eal(Canada)from September30toOctober2,2009.Thisconferenceaddressedalargeinternational audience: 61 papers were submitted originating from 14 di?erent countries. Following a thorough reviewing process, remodeled...

Mathematical Olympiad Challenges

Birkhauser, 2008

This significantly revised and expanded second edition of "Mathematical Olympiad Challenges" is a rich collection of problems put together by two experienced and well-known professors and coaches of the U.S. International Mathematical Olympiad Team. Hundreds of beautiful, challenging, and instructive problems from algebra, geometry,...

Classification Algorithms for Codes and Designs (Algorithms and Computation in Mathematics)

Springer, 2005

This book considers one of the basic problems in discrete mathematics: given a collection of constraints, describe up to isomorphism all the objects that meet them. Only a handful of classification results for combinatorial objects are dated before the mid-20th century; indeed, it is through modern computers and recent developments in algorithms...

Combinatorics, Automata and Number Theory (Encyclopedia of Mathematics and its Applications)

Cambridge University Press, 2010

This collaborative volume presents recent trends arising from the fruitful interaction between the themes of combinatorics on words, automata and formal language theory, and number theory. Presenting several important tools and concepts, the authors also reveal some of the exciting and important relationships that exist between these...

Result Page: 7 6 5 4 3 2 1