Algorithms And Computation in Mathematics

Computational Methods in Commutative Algebra and Algebraic Geometry (Algorithms and Computation in Mathematics)

Computational Methods in Commutative Algebra and Algebraic Geometry (Algorithms and Computation in Mathematics) by Wolmer Vasconcelos
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
Graphs, Networks and Algorithms (Algorithms and Computation in Mathematics) by Dieter Jungnickel [Repost]

Graphs, Networks and Algorithms (Algorithms and Computation in Mathematics) by Dieter Jungnickel
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.
Graphs, Networks and Algorithms (Algorithms and Computation in Mathematics) by Dieter Jungnickel

Graphs, Networks and Algorithms (Algorithms and Computation in Mathematics) by Dieter Jungnickel
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
Computational Ergodic Theory (Algorithms and Computation in Mathematics, Vol. 13) by Geon Ho Choe

Computational Ergodic Theory (Algorithms and Computation in Mathematics, Vol. 13) by Geon Ho Choe
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.
Graphs, Networks and Algorithms (Algorithms and Computation in Mathematics) by Dieter Jungnickel

Graphs, Networks and Algorithms (Algorithms and Computation in Mathematics) by Dieter Jungnickel
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
Polynomials (Algorithms and Computation in Mathematics) (Repost)

Polynomials (Algorithms and Computation in Mathematics) By Victor V. Prasolov, Dimitry Leites
2004 | 302 Pages | ISBN: 3642039790 , 3540407146 | PDF | 4 MB
Polynomials (Algorithms and Computation in Mathematics) (Repost)

Polynomials (Algorithms and Computation in Mathematics) By Victor V. Prasolov, Dimitry Leites
2004 | 302 Pages | ISBN: 3642039790 , 3540407146 | PDF | 4 MB
Polynomials (Algorithms and Computation in Mathematics) (Repost)

Polynomials (Algorithms and Computation in Mathematics) By Victor V. Prasolov, Dimitry Leites
2004 | 302 Pages | ISBN: 3642039790 , 3540407146 | PDF | 4 MB
Graphs, Networks and Algorithms (Algorithms and Computation in Mathematics)

Dieter Jungnickel, "Graphs, Networks and Algorithms (Algorithms and Computation in Mathematics)"
ISBN: 3642322778 | 2013 | PDF | 677 pages | 4.2 MB

Classification Algorithms for Codes and Designs (Algorithms and Computation in Mathematics)

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.