Learn IT - Books tags combinatorics

Entropy, Search, Complexity (Bolyai Society Mathematical Studies)

Springer, 2007

The present volume is a collection of survey papers in the fields of entropy, search and complexity. They summarize the latest developments in their respective areas.

More than half of the papers belong to search theory which lies on the borderline of mathematics and computer science, information theory and combinatorics, respectively. Search...

The MAPLE Book

CRC Press, 2001

Maple is a very powerful computer algebra system used by students, educators, mathematicians, statisticians, scientists, and engineers for doing numerical and symbolic computations. Greatly expanded and updated from the author's MAPLE V Primer, The MAPLE Book offers extensive coverage of the latest version of this outstanding software package,...

Recent Advances in Algorithms and Combinatorics

Springer, 2002

From the reviews:

"Combinatorics is one of the fastest growing fields of mathematics. … From the table of contents one can see the wide range of topics covered. The authors are acknowledged researchers of the presented fields and guarantee the high quality of the volume. If you want to be up-to-date in combinatorics you should...

Applied Cryptanalysis: Breaking Ciphers in the Real World

John Wiley & Sons, 2007

The book is designed to be accessible to motivated IT professionals who want to learn more about the specific attacks covered. In particular, every effort has been made to keep the chapters independent, so if someone is interested in has function cryptanalysis or RSA timing attacks, they do not necessarily need to study all of the previous material...

Puzzles for Programmers and Pros

Wrox Press, 2007

Solving puzzles demands a mindset that starts with a vulnerable openness followed by a rigorous drive to find a solution. Whether you're preparing for a programming job interview or just like a challenge, this book takes you on a tour of problem-solving techniques so you can dramatically improve your skills. You'll learn how to conquer simple...

Algorithmic Learning Theory: 15th International Conference, ALT 2004, Padova, Italy, October 2-5, 2004. Proceedings

Springer, 2004

This book constitutes the refereed proceedings of the 15th International Conference on Algorithmic Learning Theory, ALT 2004, held in Padova, Italy in October 2004.

The 29 revised full papers presented together with 5 invited papers and 3 tutorial summaries were carefully reviewed and selected from 91 submissions. The papers are organized in...

Recent Advances in Formal Languages and Applications (Studies in Computational Intelligence)

Springer, 2006

The theory of formal languages is widely accepted as the backbone of theoretical computer science. It mainly originated from mathematics (combinatorics, algebra, mathematical logic) and generative linguistics. All human problem solving capabilities can be considered in a certain sense as a manipulation of symbols and structures composed by symbols,...

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

Error-Correcting Linear Codes: Classification by Isometry and Applications

Springer, 2006

This text offers an introduction to error-correcting linear codes for graduate students in mathematics, computer science and engineering and researchers. The book differs from other standard texts in its emphasis on the classification of codes by means of isometry classes. The relevant algebraic concepts like finite fields and group actions are...

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

Memory as a Programming Concept in C and C++

Cambridge University Press, 2003

The overwhelming majority of program bugs and computer crashes stem from problems of memory access, allocation, or deallocation. Such memory-related problems are also notoriously difficult to debug. Yet the role that memory plays in C and C++ programming is a subject often overlooked in courses and books because it requires specialized knowledge...

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

Result Page: 7 6 5 4 3 2 1