Learn IT - Books tags combinatorics

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...

The Art of Computer Programming, Volume 4A: Combinatorial Algorithms, Part 1

Addison Wesley, 2011

The TITLE of Volume 4 is Combinatorial Algorithms, and when I proposed it I was strongly inclined to add a subtitle: The Kind of Programming I Like Best. Mv editors have decided to tone down such exuberance, but the fact remains that programs with a combinatorial flavor have always been my favorites.

On the other hand I've...

The Art of Computer Programming. Vol 1: Fundamental Algorithms. 2nd Printing.

Addison Wesley, 1969

Fundamental Algorithms begins with mathematical preliminaries. The first section offers a good grounding in a variety of useful mathematical tools: proof techniques, combinatorics, and elementary number theory. Knuth then details the MIX processor, a virtual machine architecture that serves as the programming target for subsequent...

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...

An Introduction to Quantum Computing

Oxford University Press, 2006

This concise, accessible text provides a thorough introduction to quantum computing - an exciting emergent field at the interface of the computer, engineering, mathematical and physical sciences. Aimed at advanced undergraduate and beginning graduate students in these disciplines, the text is technically detailed and is clearly illustrated...

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...

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...

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...

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...

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...

Mathematical Tools for Data Mining: Set Theory, Partial Orders, Combinatorics (Advanced Information and Knowledge Processing)

Springer, 2008

The maturing of the field of data mining has brought about an increased level of mathematical sophistication. Such disciplines like topology, combinatorics, partially ordered sets and their associated algebraic structures (lattices and Boolean algebras), and metric spaces are increasingly applied in data mining research. This book presents these...

General Theory of Information Transfer and Combinatorics (Lecture Notes in Computer Science)

Springer, 2007

This book constitutes the thoroughly refereed research papers contributed to a research project on the `General Theory of Information Transfer and Combinatorics' that was hosted from 2001-2004 at the Center for Interdisciplinary Research (ZIF) of Bielefeld University and also papers of several incorporated meetings thereof.

The 63 revised full...

Result Page: 7 6 5 4 3 2 1