Kategoria BISAC: Mathematics >> Discrete Mathematics

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 experts in their respective fields, and covers a wide spectrum of high-interest problems across these discipline domains. Among the contributing authors are Richard Karp of UC Berkeley and Robert Tarjan of Princeton; both are at the pinnacle of research...

Computer algebra systems are revolutionizing the teaching, the learning, and the exploration of science. Not only can students and researchers work through mathematical models more efficiently and with fewer errors than with pencil and paper, they can also easily explore, both analytically and numerically, more complex and computationally intensive models.

Aimed at science and engineering undergraduates at the sophomore/junior level, this introductory guide to the mathematical models of science is filled with examples from a wide variety of disciplines, including biology, economics,...

This introductory text to the class of Sequential Dynamical Systems (SDS) is the first textbook on this timely subject. Driven by numerous examples and thought-provoking problems throughout, the presentation offers good foundational material on finite discrete dynamical systems, which then leads systematically to an introduction of SDS. From a broad range of topics on structure theory - equivalence, fixed points, invertibility and other phase space properties - thereafter SDS relations to graph theory, classical dynamical systems as well as SDS applications in computer science are...

This undergraduate textbook introduces students of science and engineering to the fascinating field of optimization. It is a unique book that brings together the subfields of mathematical programming, variational calculus, and optimal control, thus giving students an overall view of all aspects of optimization in a single reference. As a primer on optimization, its main goal is to provide a succinct and accessible introduction to linear programming, nonlinear programming, numerical optimization algorithms, variational problems, dynamic programming, and optimal control. Prerequisites have...

Discrete probability theory and the theory of algorithms have become close partners over the last ten years, though the roots of this partnership go back much longer. The papers in this volume address the latest developments in this active field. They are from the IMA Workshops "Probability and Algorithms" and "The Finite Markov Chain Renaissance." They represent the current thinking of many of the world's leading experts in the field.

Researchers and graduate students in probability, computer science, combinatorics, and optimization theory will all be interested in this collection...

The best book on Maple just got better. This lively book is bursting with clear descriptions, revealing examples and top tips. It is gentle enough to act as an introduction and yet sufficiently comprehensive and well organised to serve as a reference manual. Maple Release 7 is significantly different to earlier releases, so this book will appeal even to hardened users who want to catch up fast.

- Des Higham, University of Strathclyde, UK

This book provides an accelerated introduction to Maple for scientific programmers who already have experience in other computer languages...