Posted by **Nice_smile)** at Aug. 25, 2015

English | Nov. 6, 1997 | ISBN: 3540605207 | 408 Pages | DJVU | 4.94 MB

From the reviews: "… Many parts of the book can be read by anyone with a basic abstract algebra course… it was one of the author's intentions to equip students who are interested in computational problems with the necessary algebraic background in pure mathematics

Posted by **AlenMiler** at June 5, 2015

English | Nov 29, 2004 | ISBN: 3540219056, 3540637605 | 627 Pages | PDF | 4 MB

Includes new chapters on the network simplex algorithm and a section on the five color theorem.

Posted by **tanas.olesya** at May 23, 2015

English | Nov 29, 2004 | ISBN: 3540219056, 3540637605 | 627 Pages | PDF | 4 MB

Includes new chapters on the network simplex algorithm and a section on the five color theorem

Posted by **tanas.olesya** at April 15, 2015

English | May 24, 2005 | ISBN: 3540231218 | 419 Pages | PDF | 11 MB

Ergodic theory is hard to study because it is based on measure theory, which is a technically difficult subject to master for ordinary students, especially for physics majors. Many of the examples are introduced from a different perspective than in other books and theoretical ideas can be gradually absorbed while doing computer experiments.

Posted by **tanas.olesya** at Feb. 10, 2015

English | Nov 16, 2007 | ISBN: 3540727795 | 655 Pages | PDF | 5 MB

Revised throughout Includes new chapters on the network simplex algorithm and a section on the five color theorem Recent developments are discussed

Posted by **bookwyrm** at Dec. 27, 2014

2004 | 302 Pages | ISBN: 3642039790 , 3540407146 | PDF | 4 MB

Posted by **avava** at April 21, 2013

ISBN: 3642322778 | 2013 | PDF | 677 pages | 4.2 MB

Posted by **ginofdagame** at June 20, 2010

Classification Algorithms for Codes and Designs (Algorithms and Computation in Mathematics) by Arjeh M. Cohen

Springer; 1 edition (December 22, 2005) | Language: English | ISBN: 3540289909 | PDF | 413 Pages | 2.04 MB

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.

Posted by **maxxum** at Jan. 20, 2007

Springer | ISBN 3540289925 | 1 Edition (April 11, 2006) | PDF | 2.3 Mb | 327 Pages

Posted by **tukotikko** at March 28, 2014

2004 | 302 Pages | ISBN: 3642039790 , 3540407146 | PDF | 4 MB