Announcement: Combinatorica book now available
From: Sriram Pemmaraju (sriram_at_cs.uiowa.edu)
Date: 01/06/04
- Next message: Kent Paul Dolan: "Re: TM Tape is Always Finite"
- Previous message: Russell Easterly: "Re: TM Tape is Always Finite"
- Messages sorted by: [ date ] [ thread ] [ subject ] [ author ]
Date: 6 Jan 2004 09:18:16 -0800
We are proud to announce that our new Combinatorica book:
Computational Discrete Mathematics: Combinatorics and Graph Theory
with Mathematica
by S. Pemmaraju and S. Skiena, and published by Cambridge University
Press,
is *finally* available from Amazon at:
http://www.amazon.com/exec/obidos/ASIN/0521806860/ref=nosim/thealgorithrepo
A blurb for the book is given below, but we encourage you to
visit
http://www.combinatorica.com to learn more about the book and the
wealth
of resources for the new and greatly improved Combinatorica.
Sriram Pemmaraju
Steven Skiena
-------------------------------------------------------------------------
"Computational Discrete Mathematics" is the definitive guide to
Combinatorica,
perhaps the most widely used software for teaching and research in
discrete
mathematics. The Combinatorica user community ranges from students to
engineers to researchers in mathematics, computer science, physics,
economics, and the humanities. Combinatorica has received the
EDUCOM Higher Education Software Award and been employed in teaching
from
grade school to graduate levels. Combinatorica is included with every
copy
of the popular computer algebra system Mathematica.
Experimenting with Combinatorica provides an exciting new way to learn
combinatorics and graph theory. This book provides examples of all
450
Combinatiorica functions in action, along with the associated
mathematical
and algorithmic theory. The book contains no formal proofs, but
enough
discussion to understand and appreciate all the algorithms and
theorems
contained within.
We cover classical and advanced topics on the most important
combinatorial
objects: permutations, subsets, partitions, and Young tableaux. We
also
cover all important areas of graph theory: graph construction
operations,
invariants, and embeddings as well as algorithmic graph theory.
This book can also serve as a unique textbook with enough material to
teach
or supplement full-semester, experimentally-enhanced courses in
combinatorics
and graph theory using Mathematica. Three interesting classes of
exercises
are provided -- theorem/proof, programming exercises, and experimental
explorations, providing great flexibility in teaching and learning the
material.
- Next message: Kent Paul Dolan: "Re: TM Tape is Always Finite"
- Previous message: Russell Easterly: "Re: TM Tape is Always Finite"
- Messages sorted by: [ date ] [ thread ] [ subject ] [ author ]