Shopping Cart
itemsitem
Facets of Combinatorial Optimization
Festschrift for Martin Grötschel
Martin Grötschel is one of the most influential mathematicians of our time. He has received numerous honors and holds a number of key positions in the international mathematical community. He celebrated his 65th birthday on September 10, 2013. Martin Grötschel’s doctoral descendant tree 1983–2012, i.e., the first 30 years, features 39 children, 74 grandchildren, 24 great-grandchildren and 2 greatProblem-Solving Methods in Combinatorics
An Approach to Olympiad Problems
Every year there is at least one combinatorics problem in each of the major international mathematical olympiads. These problems can only be solved with a very high level of wit and creativity. This book explains all the problem-solving techniques necessary to tackle these problems, with clear examples from recent contests. It also includes a large problem section for each topic, including hintsUndergraduate Texts in Mathematics
Aimed at undergraduate mathematics and computer science students, this book is an excellent introduction to a lot of problems of discrete mathematics. It discusses a number of selected results and methods, mostly from areas of combinatorics and graph theory, and it uses proofs and problem solving to help students understand the solutions to problems. Numerous examples, figures, and exercises areAlgebra In Plain and Simple English
Math for the Absolute Beginner
Do you find yourself in math clazz hearing terms like polynomials and rules of operation, but not being able to make sense of what they all mean? We've all been there! And this book is for you. It breaks math down in a way that's easy for beginners. This book starts by reviewing the essence of arithmetic (fractions, divisions, square roots, etc.), then moves on to expressions,Practical Approaches to Hard Problems
Classical computer science textbooks tell us that some problems are 'hard'. Yet many areas, from machine learning and computer vision to theorem proving and software verification, have defined their own set of tools for effectively solving complex problems. Tractability provides an overview of these different techniques, and of the fundamental concepts and properties used to tame intractability.The Basics of Computational Complexity
The focus of this book is the P versus NP Question and the theory of NP-completeness. It also provides adequate preliminaries regarding computational problems and computational models. The P versus NP Question asks whether or not finding solutions is harder than checking the correctness of solutions. An alternative formulation asks whether or not discovering proofs is harder than verifying their