A high quality book for the specialist, 18 Jun 2001
The book gives a highly detailed account of how informative, and aesthetically pleasing, diagrams can be generated from underlying relationship information.

While a diagram can contain simple information, such a an artist's name and her/his lifespan, it may also contain this type of information for multiple artists involved with multiple disciplines. The problem, for the graphics designer, is to develop some form of encoding to represent this information. This book describes first of all what types of relationships can be illustrated in diagrams, and how, and then explains how more complex relations are made up of simpler ones, and thus can be constructed with the same sets of rules. Algorithms are given for generating the resulting diagrams automatically. The results are more than convincing.

This book is not for the faint-hearted, but if this field is of interest then it is an excellent academic book.

A high quality book for the specialist, 18 Jun 2001
The book gives a highly detailed account of how informative, and aesthetically pleasing, diagrams can be generated from underlying relationship information.

While a diagram can contain simple information, such a an artist's name and her/his lifespan, it may also contain this type of information for multiple artists involved with multiple disciplines. The problem, for the graphics designer, is to develop some form of encoding to represent this information. This book describes first of all what types of relationships can be illustrated in diagrams, and how, and then explains how more complex relations are made up of simpler ones, and thus can be constructed with the same sets of rules. Algorithms are given for generating the resulting diagrams automatically. The results are more than convincing.

This book is not for the faint-hearted, but if this field is of interest then it is an excellent academic book.

Dry and outdated, but cheap, 27 Apr 2004
This book offers a lot of content for a low price. That's the good thingabout it.
The bad thing is that it's difficult to read - it's very dry and boring.Of course, pretty much everything in mathematics is dry and boring, but Iknow lots of math books which teach far more efficiently than this one. Itgives too many examples and often doesn't go straight to the point, and itdidn't make it clear why the hell one would want to learn about grouptheory.
Also, the some notation used in this book is outdated, which is slightlyannoying at times as it just adds to the confusion of a confusing subject.

Great book for an introduction to graph theory., 11 Jun 2001
This book has all the information to get you through any graph theory course. The theory is explained well but the most helpfull is the hundreds of examples. There are a few examples on every topic in the book that are simple enough for anyone to read.

A high quality book for the specialist, 18 Jun 2001
The book gives a highly detailed account of how informative, and aesthetically pleasing, diagrams can be generated from underlying relationship information.

While a diagram can contain simple information, such a an artist's name and her/his lifespan, it may also contain this type of information for multiple artists involved with multiple disciplines. The problem, for the graphics designer, is to develop some form of encoding to represent this information. This book describes first of all what types of relationships can be illustrated in diagrams, and how, and then explains how more complex relations are made up of simpler ones, and thus can be constructed with the same sets of rules. Algorithms are given for generating the resulting diagrams automatically. The results are more than convincing.

This book is not for the faint-hearted, but if this field is of interest then it is an excellent academic book.

Dry and outdated, but cheap, 27 Apr 2004
This book offers a lot of content for a low price. That's the good thingabout it.
The bad thing is that it's difficult to read - it's very dry and boring.Of course, pretty much everything in mathematics is dry and boring, but Iknow lots of math books which teach far more efficiently than this one. Itgives too many examples and often doesn't go straight to the point, and itdidn't make it clear why the hell one would want to learn about grouptheory.
Also, the some notation used in this book is outdated, which is slightlyannoying at times as it just adds to the confusion of a confusing subject.

Great book for an introduction to graph theory., 11 Jun 2001
This book has all the information to get you through any graph theory course. The theory is explained well but the most helpfull is the hundreds of examples. There are a few examples on every topic in the book that are simple enough for anyone to read.

Vague and outdated., 12 Jun 2008
Although the author's style of writing is pleasant, the book leaves much to be desired.

Initially the most basic concepts are spelled out, and even derived in the early chapters, the later chapters stray from this, and some of the important results differ from the suggested derivation.

Admittedly no single website would provide as much information as clearly, and this book is a usefull start for those new to the field. But it should be read with critical attention to the details, and without any compunction about closing the book and getting on with the task in hand.

Perfect for getting started., 19 Dec 1999
I have a background in computing and biology but my maths is sketchy. I found this book a perfect practical introduction to the mathematical side - from basic principles to advanced GA theory. This book provides an exelent introduction to practical GA application. The first few chapters document a simple GA (SGA)written in Pascal (easily understandable to anyone with programming experience) to get you started. In all a very usefull book for those new to GA's.

Explains *and* entertains, 24 Apr 1999
I bought this book while I was a working professional. It is one of the few textbooks that I have ever read straight through, like a novel. In addition to making everything clear and interesting, the book was even funny at times! I didn't think that was allowed in textbooks. ;-)

a classic, 31 Jan 1999
Golberg's book is a classic in the field of genetic algorithms. It introduces the reader to the field of genetic algorithms in a clear and understandable manner, while at the same time maintaining a sense of scientific analysis and promise. If you are interested in the field, you should own this book.

Introduce GA and its applications gradually and clearly., 11 Nov 1997
This book introduces GA from simple to advance.It gives you an overview of GA applications on search,optimization and machine learning.

A high quality book for the specialist, 18 Jun 2001
The book gives a highly detailed account of how informative, and aesthetically pleasing, diagrams can be generated from underlying relationship information.

While a diagram can contain simple information, such a an artist's name and her/his lifespan, it may also contain this type of information for multiple artists involved with multiple disciplines. The problem, for the graphics designer, is to develop some form of encoding to represent this information. This book describes first of all what types of relationships can be illustrated in diagrams, and how, and then explains how more complex relations are made up of simpler ones, and thus can be constructed with the same sets of rules. Algorithms are given for generating the resulting diagrams automatically. The results are more than convincing.

This book is not for the faint-hearted, but if this field is of interest then it is an excellent academic book.

Dry and outdated, but cheap, 27 Apr 2004
This book offers a lot of content for a low price. That's the good thingabout it.
The bad thing is that it's difficult to read - it's very dry and boring.Of course, pretty much everything in mathematics is dry and boring, but Iknow lots of math books which teach far more efficiently than this one. Itgives too many examples and often doesn't go straight to the point, and itdidn't make it clear why the hell one would want to learn about grouptheory.
Also, the some notation used in this book is outdated, which is slightlyannoying at times as it just adds to the confusion of a confusing subject.

Great book for an introduction to graph theory., 11 Jun 2001
This book has all the information to get you through any graph theory course. The theory is explained well but the most helpfull is the hundreds of examples. There are a few examples on every topic in the book that are simple enough for anyone to read.

Vague and outdated., 12 Jun 2008
Although the author's style of writing is pleasant, the book leaves much to be desired.

Initially the most basic concepts are spelled out, and even derived in the early chapters, the later chapters stray from this, and some of the important results differ from the suggested derivation.

Admittedly no single website would provide as much information as clearly, and this book is a usefull start for those new to the field. But it should be read with critical attention to the details, and without any compunction about closing the book and getting on with the task in hand.

Perfect for getting started., 19 Dec 1999
I have a background in computing and biology but my maths is sketchy. I found this book a perfect practical introduction to the mathematical side - from basic principles to advanced GA theory. This book provides an exelent introduction to practical GA application. The first few chapters document a simple GA (SGA)written in Pascal (easily understandable to anyone with programming experience) to get you started. In all a very usefull book for those new to GA's.

Explains *and* entertains, 24 Apr 1999
I bought this book while I was a working professional. It is one of the few textbooks that I have ever read straight through, like a novel. In addition to making everything clear and interesting, the book was even funny at times! I didn't think that was allowed in textbooks. ;-)

a classic, 31 Jan 1999
Golberg's book is a classic in the field of genetic algorithms. It introduces the reader to the field of genetic algorithms in a clear and understandable manner, while at the same time maintaining a sense of scientific analysis and promise. If you are interested in the field, you should own this book.

Introduce GA and its applications gradually and clearly., 11 Nov 1997
This book introduces GA from simple to advance.It gives you an overview of GA applications on search,optimization and machine learning.

The Best Book about Modern Cryptography, 11 Dec 2007
I used this book for a course on modern cryptography held by Prof. Persiano of the University of Salerno, Italy.
I read, consulted, and studied other books about cryptography, but 'INTRODUCTION TO MODERN CRYPTOGRAPHY' by Katz and Lindell is in my humble opinion THE BEST.
The book has a theoretical flavor, it is mathematically rigorous, but it is very readable and fluent, and presents the motivating discussions beneath each topic.
The book is fully self-contained, and gives the necessary background for each topic (for example there is a lot of basic computational number theory necessary for introducing the topic of 'public key').
The beauty of the book is in that the authors don't present a collection of protocols, with no links each other, but the flow is sequential and motivated (in contrast to books which present topics only for filling the pages).
All the theorems are proved and the treatment is rigorous, but the theory is developed from scratch, and the book is oriented to beginner students, though it presents also advanced stuff and is one of the most advanced book for beginners.
The main contents of the book are:

1) Perfect security and Shannon's theorem (information theoretic security)
2) Computational security, indistinguishability, CPA
3) Pseudorandomness
4) One-way functions, hard-core predicate, Levin's theorem
5) Message Authentication Codes
6) Costructions of Pseudorandom objects, AES, Substitution-Permutation networks
7) Relation between Private-Key, one-way functions and pseudrandomness.
8) Number theory for the cryptography
9) Computational number theory, factorization, square roots,discrete log,diffie-hellman problems
10) Public key, goldwasser-micali, el gamal, pallier, hybrid encryption, encryption schemes based on trapdoor permutations
11)Digital Signature Schemes
I wrote only some topics of the book following my taste, but the books contains much more.
The complete table of contents for this book is on the web site of the authors.
The exercises left to the end of each chapters are good, and vary from easy to hard.

I advice this book to everyone who wants start the study of modern cryptography from a theoretic and rigorous point of view.
After you read Katz and Lindell i suggest you to read "Foundations of Cryptography" by Goldreich, but it is too advanced and its reading requires you already read Katz and Lindell.

A high quality book for the specialist, 18 Jun 2001
The book gives a highly detailed account of how informative, and aesthetically pleasing, diagrams can be generated from underlying relationship information.

While a diagram can contain simple information, such a an artist's name and her/his lifespan, it may also contain this type of information for multiple artists involved with multiple disciplines. The problem, for the graphics designer, is to develop some form of encoding to represent this information. This book describes first of all what types of relationships can be illustrated in diagrams, and how, and then explains how more complex relations are made up of simpler ones, and thus can be constructed with the same sets of rules. Algorithms are given for generating the resulting diagrams automatically. The results are more than convincing.

This book is not for the faint-hearted, but if this field is of interest then it is an excellent academic book.

Dry and outdated, but cheap, 27 Apr 2004
This book offers a lot of content for a low price. That's the good thingabout it.
The bad thing is that it's difficult to read - it's very dry and boring.Of course, pretty much everything in mathematics is dry and boring, but Iknow lots of math books which teach far more efficiently than this one. Itgives too many examples and often doesn't go straight to the point, and itdidn't make it clear why the hell one would want to learn about grouptheory.
Also, the some notation used in this book is outdated, which is slightlyannoying at times as it just adds to the confusion of a confusing subject.

Great book for an introduction to graph theory., 11 Jun 2001
This book has all the information to get you through any graph theory course. The theory is explained well but the most helpfull is the hundreds of examples. There are a few examples on every topic in the book that are simple enough for anyone to read.

Vague and outdated., 12 Jun 2008
Although the author's style of writing is pleasant, the book leaves much to be desired.

Initially the most basic concepts are spelled out, and even derived in the early chapters, the later chapters stray from this, and some of the important results differ from the suggested derivation.

Admittedly no single website would provide as much information as clearly, and this book is a usefull start for those new to the field. But it should be read with critical attention to the details, and without any compunction about closing the book and getting on with the task in hand.

Perfect for getting started., 19 Dec 1999
I have a background in computing and biology but my maths is sketchy. I found this book a perfect practical introduction to the mathematical side - from basic principles to advanced GA theory. This book provides an exelent introduction to practical GA application. The first few chapters document a simple GA (SGA)written in Pascal (easily understandable to anyone with programming experience) to get you started. In all a very usefull book for those new to GA's.

Explains *and* entertains, 24 Apr 1999
I bought this book while I was a working professional. It is one of the few textbooks that I have ever read straight through, like a novel. In addition to making everything clear and interesting, the book was even funny at times! I didn't think that was allowed in textbooks. ;-)

a classic, 31 Jan 1999
Golberg's book is a classic in the field of genetic algorithms. It introduces the reader to the field of genetic algorithms in a clear and understandable manner, while at the same time maintaining a sense of scientific analysis and promise. If you are interested in the field, you should own this book.

Introduce GA and its applications gradually and clearly., 11 Nov 1997
This book introduces GA from simple to advance.It gives you an overview of GA applications on search,optimization and machine learning.

The Best Book about Modern Cryptography, 11 Dec 2007
I used this book for a course on modern cryptography held by Prof. Persiano of the University of Salerno, Italy.
I read, consulted, and studied other books about cryptography, but 'INTRODUCTION TO MODERN CRYPTOGRAPHY' by Katz and Lindell is in my humble opinion THE BEST.
The book has a theoretical flavor, it is mathematically rigorous, but it is very readable and fluent, and presents the motivating discussions beneath each topic.
The book is fully self-contained, and gives the necessary background for each topic (for example there is a lot of basic computational number theory necessary for introducing the topic of 'public key').
The beauty of the book is in that the authors don't present a collection of protocols, with no links each other, but the flow is sequential and motivated (in contrast to books which present topics only for filling the pages).
All the theorems are proved and the treatment is rigorous, but the theory is developed from scratch, and the book is oriented to beginner students, though it presents also advanced stuff and is one of the most advanced book for beginners.
The main contents of the book are:

1) Perfect security and Shannon's theorem (information theoretic security)
2) Computational security, indistinguishability, CPA
3) Pseudorandomness
4) One-way functions, hard-core predicate, Levin's theorem
5) Message Authentication Codes
6) Costructions of Pseudorandom objects, AES, Substitution-Permutation networks
7) Relation between Private-Key, one-way functions and pseudrandomness.
8) Number theory for the cryptography
9) Computational number theory, factorization, square roots,discrete log,diffie-hellman problems
10) Public key, goldwasser-micali, el gamal, pallier, hybrid encryption, encryption schemes based on trapdoor permutations
11)Digital Signature Schemes
I wrote only some topics of the book following my taste, but the books contains much more.
The complete table of contents for this book is on the web site of the authors.
The exercises left to the end of each chapters are good, and vary from easy to hard.

I advice this book to everyone who wants start the study of modern cryptography from a theoretic and rigorous point of view.
After you read Katz and Lindell i suggest you to read "Foundations of Cryptography" by Goldreich, but it is too advanced and its reading requires you already read Katz and Lindell.

An essential purchase, simply exemplary., 13 Feb 2000
Combinatorics, in my experience, is never an easy subject to summarise - indeed, it has never before existed in such a readable form as is presented here by Balakrishnan. The text is generally excellent, bar a few minor faults or lack of depth regarding complex theory, and succeeds in its ambitious attempt to make the subject both approachable to the novice mathematician, and still worthwhile for the more informed, experienced reader. In my opinion, having studied Combinatorics in some depth during my degree programme, I can wholeheartedly recommend this introduction to Schaum, it is an invaluable reference guide, with as many questions posed to challenge the reader as those answered in some depth within the text. A truly brilliant realisation of an ambitious study, 'Outline of Combinatorics' is an excellent and refreshing approach to Schaum, and an essential purchase for the undergraduate and qualified mathematician alike. Superb.

A high quality book for the specialist, 18 Jun 2001
The book gives a highly detailed account of how informative, and aesthetically pleasing, diagrams can be generated from underlying relationship information.

While a diagram can contain simple information, such a an artist's name and her/his lifespan, it may also contain this type of information for multiple artists involved with multiple disciplines. The problem, for the graphics designer, is to develop some form of encoding to represent this information. This book describes first of all what types of relationships can be illustrated in diagrams, and how, and then explains how more complex relations are made up of simpler ones, and thus can be constructed with the same sets of rules. Algorithms are given for generating the resulting diagrams automatically. The results are more than convincing.

This book is not for the faint-hearted, but if this field is of interest then it is an excellent academic book.

Dry and outdated, but cheap, 27 Apr 2004
This book offers a lot of content for a low price. That's the good thingabout it.
The bad thing is that it's difficult to read - it's very dry and boring.Of course, pretty much everything in mathematics is dry and boring, but Iknow lots of math books which teach far more efficiently than this one. Itgives too many examples and often doesn't go straight to the point, and itdidn't make it clear why the hell one would want to learn about grouptheory.
Also, the some notation used in this book is outdated, which is slightlyannoying at times as it just adds to the confusion of a confusing subject.

Great book for an introduction to graph theory., 11 Jun 2001
This book has all the information to get you through any graph theory course. The theory is explained well but the most helpfull is the hundreds of examples. There are a few examples on every topic in the book that are simple enough for anyone to read.

Vague and outdated., 12 Jun 2008
Although the author's style of writing is pleasant, the book leaves much to be desired.

Initially the most basic concepts are spelled out, and even derived in the early chapters, the later chapters stray from this, and some of the important results differ from the suggested derivation.

Admittedly no single website would provide as much information as clearly, and this book is a usefull start for those new to the field. But it should be read with critical attention to the details, and without any compunction about closing the book and getting on with the task in hand.

Perfect for getting started., 19 Dec 1999
I have a background in computing and biology but my maths is sketchy. I found this book a perfect practical introduction to the mathematical side - from basic principles to advanced GA theory. This book provides an exelent introduction to practical GA application. The first few chapters document a simple GA (SGA)written in Pascal (easily understandable to anyone with programming experience) to get you started. In all a very usefull book for those new to GA's.

Explains *and* entertains, 24 Apr 1999
I bought this book while I was a working professional. It is one of the few textbooks that I have ever read straight through, like a novel. In addition to making everything clear and interesting, the book was even funny at times! I didn't think that was allowed in textbooks. ;-)

a classic, 31 Jan 1999
Golberg's book is a classic in the field of genetic algorithms. It introduces the reader to the field of genetic algorithms in a clear and understandable manner, while at the same time maintaining a sense of scientific analysis and promise. If you are interested in the field, you should own this book.

Introduce GA and its applications gradually and clearly., 11 Nov 1997
This book introduces GA from simple to advance.It gives you an overview of GA applications on search,optimization and machine learning.

The Best Book about Modern Cryptography, 11 Dec 2007
I used this book for a course on modern cryptography held by Prof. Persiano of the University of Salerno, Italy.
I read, consulted, and studied other books about cryptography, but 'INTRODUCTION TO MODERN CRYPTOGRAPHY' by Katz and Lindell is in my humble opinion THE BEST.
The book has a theoretical flavor, it is mathematically rigorous, but it is very readable and fluent, and presents the motivating discussions beneath each topic.
The book is fully self-contained, and gives the necessary background for each topic (for example there is a lot of basic computational number theory necessary for introducing the topic of 'public key').
The beauty of the book is in that the authors don't present a collection of protocols, with no links each other, but the flow is sequential and motivated (in contrast to books which present topics only for filling the pages).
All the theorems are proved and the treatment is rigorous, but the theory is developed from scratch, and the book is oriented to beginner students, though it presents also advanced stuff and is one of the most advanced book for beginners.
The main contents of the book are:

1) Perfect security and Shannon's theorem (information theoretic security)
2) Computational security, indistinguishability, CPA
3) Pseudorandomness
4) One-way functions, hard-core predicate, Levin's theorem
5) Message Authentication Codes
6) Costructions of Pseudorandom objects, AES, Substitution-Permutation networks
7) Relation between Private-Key, one-way functions and pseudrandomness.
8) Number theory for the cryptography
9) Computational number theory, factorization, square roots,discrete log,diffie-hellman problems
10) Public key, goldwasser-micali, el gamal, pallier, hybrid encryption, encryption schemes based on trapdoor permutations
11)Digital Signature Schemes
I wrote only some topics of the book following my taste, but the books contains much more.
The complete table of contents for this book is on the web site of the authors.
The exercises left to the end of each chapters are good, and vary from easy to hard.

I advice this book to everyone who wants start the study of modern cryptography from a theoretic and rigorous point of view.
After you read Katz and Lindell i suggest you to read "Foundations of Cryptography" by Goldreich, but it is too advanced and its reading requires you already read Katz and Lindell.

An essential purchase, simply exemplary., 13 Feb 2000
Combinatorics, in my experience, is never an easy subject to summarise - indeed, it has never before existed in such a readable form as is presented here by Balakrishnan. The text is generally excellent, bar a few minor faults or lack of depth regarding complex theory, and succeeds in its ambitious attempt to make the subject both approachable to the novice mathematician, and still worthwhile for the more informed, experienced reader. In my opinion, having studied Combinatorics in some depth during my degree programme, I can wholeheartedly recommend this introduction to Schaum, it is an invaluable reference guide, with as many questions posed to challenge the reader as those answered in some depth within the text. A truly brilliant realisation of an ambitious study, 'Outline of Combinatorics' is an excellent and refreshing approach to Schaum, and an essential purchase for the undergraduate and qualified mathematician alike. Superb.

Probably the greatest work in graph theory of all time, 08 Oct 2007
rigorous yet accessible - this book is the entire stimulus for my lov of graph theory, and indeed my research project.

A high quality book for the specialist, 18 Jun 2001
The book gives a highly detailed account of how informative, and aesthetically pleasing, diagrams can be generated from underlying relationship information.

While a diagram can contain simple information, such a an artist's name and her/his lifespan, it may also contain this type of information for multiple artists involved with multiple disciplines. The problem, for the graphics designer, is to develop some form of encoding to represent this information. This book describes first of all what types of relationships can be illustrated in diagrams, and how, and then explains how more complex relations are made up of simpler ones, and thus can be constructed with the same sets of rules. Algorithms are given for generating the resulting diagrams automatically. The results are more than convincing.

This book is not for the faint-hearted, but if this field is of interest then it is an excellent academic book.

Dry and outdated, but cheap, 27 Apr 2004
This book offers a lot of content for a low price. That's the good thingabout it.
The bad thing is that it's difficult to read - it's very dry and boring.Of course, pretty much everything in mathematics is dry and boring, but Iknow lots of math books which teach far more efficiently than this one. Itgives too many examples and often doesn't go straight to the point, and itdidn't make it clear why the hell one would want to learn about grouptheory.
Also, the some notation used in this book is outdated, which is slightlyannoying at times as it just adds to the confusion of a confusing subject.

Great book for an introduction to graph theory., 11 Jun 2001
This book has all the information to get you through any graph theory course. The theory is explained well but the most helpfull is the hundreds of examples. There are a few examples on every topic in the book that are simple enough for anyone to read.

Vague and outdated., 12 Jun 2008
Although the author's style of writing is pleasant, the book leaves much to be desired.

Initially the most basic concepts are spelled out, and even derived in the early chapters, the later chapters stray from this, and some of the important results differ from the suggested derivation.

Admittedly no single website would provide as much information as clearly, and this book is a usefull start for those new to the field. But it should be read with critical attention to the details, and without any compunction about closing the book and getting on with the task in hand.

Perfect for getting started., 19 Dec 1999
I have a background in computing and biology but my maths is sketchy. I found this book a perfect practical introduction to the mathematical side - from basic principles to advanced GA theory. This book provides an exelent introduction to practical GA application. The first few chapters document a simple GA (SGA)written in Pascal (easily understandable to anyone with programming experience) to get you started. In all a very usefull book for those new to GA's.

Explains *and* entertains, 24 Apr 1999
I bought this book while I was a working professional. It is one of the few textbooks that I have ever read straight through, like a novel. In addition to making everything clear and interesting, the book was even funny at times! I didn't think that was allowed in textbooks. ;-)

a classic, 31 Jan 1999
Golberg's book is a classic in the field of genetic algorithms. It introduces the reader to the field of genetic algorithms in a clear and understandable manner, while at the same time maintaining a sense of scientific analysis and promise. If you are interested in the field, you should own this book.

Introduce GA and its applications gradually and clearly., 11 Nov 1997
This book introduces GA from simple to advance.It gives you an overview of GA applications on search,optimization and machine learning.

The Best Book about Modern Cryptography, 11 Dec 2007
I used this book for a course on modern cryptography held by Prof. Persiano of the University of Salerno, Italy.
I read, consulted, and studied other books about cryptography, but 'INTRODUCTION TO MODERN CRYPTOGRAPHY' by Katz and Lindell is in my humble opinion THE BEST.
The book has a theoretical flavor, it is mathematically rigorous, but it is very readable and fluent, and presents the motivating discussions beneath each topic.
The book is fully self-contained, and gives the necessary background for each topic (for example there is a lot of basic computational number theory necessary for introducing the topic of 'public key').
The beauty of the book is in that the authors don't present a collection of protocols, with no links each other, but the flow is sequential and motivated (in contrast to books which present topics only for filling the pages).
All the theorems are proved and the treatment is rigorous, but the theory is developed from scratch, and the book is oriented to beginner students, though it presents also advanced stuff and is one of the most advanced book for beginners.
The main contents of the book are:

1) Perfect security and Shannon's theorem (information theoretic security)
2) Computational security, indistinguishability, CPA
3) Pseudorandomness
4) One-way functions, hard-core predicate, Levin's theorem
5) Message Authentication Codes
6) Costructions of Pseudorandom objects, AES, Substitution-Permutation networks
7) Relation between Private-Key, one-way functions and pseudrandomness.
8) Number theory for the cryptography
9) Computational number theory, factorization, square roots,discrete log,diffie-hellman problems
10) Public key, goldwasser-micali, el gamal, pallier, hybrid encryption, encryption schemes based on trapdoor permutations
11)Digital Signature Schemes
I wrote only some topics of the book following my taste, but the books contains much more.
The complete table of contents for this book is on the web site of the authors.
The exercises left to the end of each chapters are good, and vary from easy to hard.

I advice this book to everyone who wants start the study of modern cryptography from a theoretic and rigorous point of view.
After you read Katz and Lindell i suggest you to read "Foundations of Cryptography" by Goldreich, but it is too advanced and its reading requires you already read Katz and Lindell.

An essential purchase, simply exemplary., 13 Feb 2000
Combinatorics, in my experience, is never an easy subject to summarise - indeed, it has never before existed in such a readable form as is presented here by Balakrishnan. The text is generally excellent, bar a few minor faults or lack of depth regarding complex theory, and succeeds in its ambitious attempt to make the subject both approachable to the novice mathematician, and still worthwhile for the more informed, experienced reader. In my opinion, having studied Combinatorics in some depth during my degree programme, I can wholeheartedly recommend this introduction to Schaum, it is an invaluable reference guide, with as many questions posed to challenge the reader as those answered in some depth within the text. A truly brilliant realisation of an ambitious study, 'Outline of Combinatorics' is an excellent and refreshing approach to Schaum, and an essential purchase for the undergraduate and qualified mathematician alike. Superb.

Probably the greatest work in graph theory of all time, 08 Oct 2007
rigorous yet accessible - this book is the entire stimulus for my lov of graph theory, and indeed my research project.

Rewarding, but not easy, reading, 17 Dec 2000
Watts' innovative study of the small world phenomena has helped to revitalise this field of research, which had until recently been considered trivial in academic circles, material for anecdotes, rather than an important feature of network organisation. Watts shows how and why networks can be organised along small world principles, with examples as diverse as the spread of diseases (or gossip) through a population, the connectivity of worm's neural structures, and, infamously, the Kevin Bacon Game. While the book starts at a gentle pace, the mathematical detail soon becomes fairly dense, especially for those with little post-school mathematical training. However, the reader's perseverance is rewarded by Watts, who has provided a range of applications of small world theory, making this a must for anyone planning to study network organisation.

A high quality book for the specialist, 18 Jun 2001
The book gives a highly detailed account of how informative, and aesthetically pleasing, diagrams can be generated from underlying relationship information.

While a diagram can contain simple information, such a an artist's name and her/his lifespan, it may also contain this type of information for multiple artists involved with multiple disciplines. The problem, for the graphics designer, is to develop some form of encoding to represent this information. This book describes first of all what types of relationships can be illustrated in diagrams, and how, and then explains how more complex relations are made up of simpler ones, and thus can be constructed with the same sets of rules. Algorithms are given for generating the resulting diagrams automatically. The results are more than convincing.

This book is not for the faint-hearted, but if this field is of interest then it is an excellent academic book.

Dry and outdated, but cheap, 27 Apr 2004
This book offers a lot of content for a low price. That's the good thingabout it.
The bad thing is that it's difficult to read - it's very dry and boring.Of course, pretty much everything in mathematics is dry and boring, but Iknow lots of math books which teach far more efficiently than this one. Itgives too many examples and often doesn't go straight to the point, and itdidn't make it clear why the hell one would want to learn about grouptheory.
Also, the some notation used in this book is outdated, which is slightlyannoying at times as it just adds to the confusion of a confusing subject.

Great book for an introduction to graph theory., 11 Jun 2001
This book has all the information to get you through any graph theory course. The theory is explained well but the most helpfull is the hundreds of examples. There are a few examples on every topic in the book that are simple enough for anyone to read.

Vague and outdated., 12 Jun 2008
Although the author's style of writing is pleasant, the book leaves much to be desired.

Initially the most basic concepts are spelled out, and even derived in the early chapters, the later chapters stray from this, and some of the important results differ from the suggested derivation.

Admittedly no single website would provide as much information as clearly, and this book is a usefull start for those new to the field. But it should be read with critical attention to the details, and without any compunction about closing the book and getting on with the task in hand.

Perfect for getting started., 19 Dec 1999
I have a background in computing and biology but my maths is sketchy. I found this book a perfect practical introduction to the mathematical side - from basic principles to advanced GA theory. This book provides an exelent introduction to practical GA application. The first few chapters document a simple GA (SGA)written in Pascal (easily understandable to anyone with programming experience) to get you started. In all a very usefull book for those new to GA's.

Explains *and* entertains, 24 Apr 1999
I bought this book while I was a working professional. It is one of the few textbooks that I have ever read straight through, like a novel. In addition to making everything clear and interesting, the book was even funny at times! I didn't think that was allowed in textbooks. ;-)

a classic, 31 Jan 1999
Golberg's book is a classic in the field of genetic algorithms. It introduces the reader to the field of genetic algorithms in a clear and understandable manner, while at the same time maintaining a sense of scientific analysis and promise. If you are interested in the field, you should own this book.

Introduce GA and its applications gradually and clearly., 11 Nov 1997
This book introduces GA from simple to advance.It gives you an overview of GA applications on search,optimization and machine learning.

The Best Book about Modern Cryptography, 11 Dec 2007
I used this book for a course on modern cryptography held by Prof. Persiano of the University of Salerno, Italy.
I read, consulted, and studied other books about cryptography, but 'INTRODUCTION TO MODERN CRYPTOGRAPHY' by Katz and Lindell is in my humble opinion THE BEST.
The book has a theoretical flavor, it is mathematically rigorous, but it is very readable and fluent, and presents the motivating discussions beneath each topic.
The book is fully self-contained, and gives the necessary background for each topic (for example there is a lot of basic computational number theory necessary for introducing the topic of 'public key').
The beauty of the book is in that the authors don't present a collection of protocols, with no links each other, but the flow is sequential and motivated (in contrast to books which present topics only for filling the pages).
All the theorems are proved and the treatment is rigorous, but the theory is developed from scratch, and the book is oriented to beginner students, though it presents also advanced stuff and is one of the most advanced book for beginners.
The main contents of the book are:

1) Perfect security and Shannon's theorem (information theoretic security)
2) Computational security, indistinguishability, CPA
3) Pseudorandomness
4) One-way functions, hard-core predicate, Levin's theorem
5) Message Authentication Codes
6) Costructions of Pseudorandom objects, AES, Substitution-Permutation networks
7) Relation between Private-Key, one-way functions and pseudrandomness.
8) Number theory for the cryptography
9) Computational number theory, factorization, square roots,discrete log,diffie-hellman problems
10) Public key, goldwasser-micali, el gamal, pallier, hybrid encryption, encryption schemes based on trapdoor permutations
11)Digital Signature Schemes
I wrote only some topics of the book following my taste, but the books contains much more.
The complete table of contents for this book is on the web site of the authors.
The exercises left to the end of each chapters are good, and vary from easy to hard.

I advice this book to everyone who wants start the study of modern cryptography from a theoretic and rigorous point of view.
After you read Katz and Lindell i suggest you to read "Foundations of Cryptography" by Goldreich, but it is too advanced and its reading requires you already read Katz and Lindell.

An essential purchase, simply exemplary., 13 Feb 2000
Combinatorics, in my experience, is never an easy subject to summarise - indeed, it has never before existed in such a readable form as is presented here by Balakrishnan. The text is generally excellent, bar a few minor faults or lack of depth regarding complex theory, and succeeds in its ambitious attempt to make the subject both approachable to the novice mathematician, and still worthwhile for the more informed, experienced reader. In my opinion, having studied Combinatorics in some depth during my degree programme, I can wholeheartedly recommend this introduction to Schaum, it is an invaluable reference guide, with as many questions posed to challenge the reader as those answered in some depth within the text. A truly brilliant realisation of an ambitious study, 'Outline of Combinatorics' is an excellent and refreshing approach to Schaum, and an essential purchase for the undergraduate and qualified mathematician alike. Superb.

Probably the greatest work in graph theory of all time, 08 Oct 2007
rigorous yet accessible - this book is the entire stimulus for my lov of graph theory, and indeed my research project.

Rewarding, but not easy, reading, 17 Dec 2000
Watts' innovative study of the small world phenomena has helped to revitalise this field of research, which had until recently been considered trivial in academic circles, material for anecdotes, rather than an important feature of network organisation. Watts shows how and why networks can be organised along small world principles, with examples as diverse as the spread of diseases (or gossip) through a population, the connectivity of worm's neural structures, and, infamously, the Kevin Bacon Game. While the book starts at a gentle pace, the mathematical detail soon becomes fairly dense, especially for those with little post-school mathematical training. However, the reader's perseverance is rewarded by Watts, who has provided a range of applications of small world theory, making this a must for anyone planning to study network organisation.

at the core of mathematics, 02 Feb 2006
this book deals in a friendly fashion with inequalities (and therefore) with the elementary use of convexity and integrals.
Famous inequalities bear the name of famous mathematicians, e.g: Tchebychev, Hilbert, Cauchy, Hardy, Rademacher...This is one way to understand their significance in maths. This book is about those ones and others such as 3/2 < a/(b+c) + b/(c+a) + c/(a+b) and the many ways to tackle with the fact of proving and using them. Study of this book should be seen as a good and rewarding path towards improving one's mathematical skill's

A high quality book for the specialist, 18 Jun 2001
The book gives a highly detailed account of how informative, and aesthetically pleasing, diagrams can be generated from underlying relationship information.

While a diagram can contain simple information, such a an artist's name and her/his lifespan, it may also contain this type of information for multiple artists involved with multiple disciplines. The problem, for the graphics designer, is to develop some form of encoding to represent this information. This book describes first of all what types of relationships can be illustrated in diagrams, and how, and then explains how more complex relations are made up of simpler ones, and thus can be constructed with the same sets of rules. Algorithms are given for generating the resulting diagrams automatically. The results are more than convincing.

This book is not for the faint-hearted, but if this field is of interest then it is an excellent academic book.

Dry and outdated, but cheap, 27 Apr 2004
This book offers a lot of content for a low price. That's the good thingabout it.
The bad thing is that it's difficult to read - it's very dry and boring.Of course, pretty much everything in mathematics is dry and boring, but Iknow lots of math books which teach far more efficiently than this one. Itgives too many examples and often doesn't go straight to the point, and itdidn't make it clear why the hell one would want to learn about grouptheory.
Also, the some notation used in this book is outdated, which is slightlyannoying at times as it just adds to the confusion of a confusing subject.

Great book for an introduction to graph theory., 11 Jun 2001
This book has all the information to get you through any graph theory course. The theory is explained well but the most helpfull is the hundreds of examples. There are a few examples on every topic in the book that are simple enough for anyone to read.

Vague and outdated., 12 Jun 2008
Although the author's style of writing is pleasant, the book leaves much to be desired.

Initially the most basic concepts are spelled out, and even derived in the early chapters, the later chapters stray from this, and some of the important results differ from the suggested derivation.

Admittedly no single website would provide as much information as clearly, and this book is a usefull start for those new to the field. But it should be read with critical attention to the details, and without any compunction about closing the book and getting on with the task in hand.

Perfect for getting started., 19 Dec 1999
I have a background in computing and biology but my maths is sketchy. I found this book a perfect practical introduction to the mathematical side - from basic principles to advanced GA theory. This book provides an exelent introduction to practical GA application. The first few chapters document a simple GA (SGA)written in Pascal (easily understandable to anyone with programming experience) to get you started. In all a very usefull book for those new to GA's.

Explains *and* entertains, 24 Apr 1999
I bought this book while I was a working professional. It is one of the few textbooks that I have ever read straight through, like a novel. In addition to making everything clear and interesting, the book was even funny at times! I didn't think that was allowed in textbooks. ;-)

a classic, 31 Jan 1999
Golberg's book is a classic in the field of genetic algorithms. It introduces the reader to the field of genetic algorithms in a clear and understandable manner, while at the same time maintaining a sense of scientific analysis and promise. If you are interested in the field, you should own this book.

Introduce GA and its applications gradually and clearly., 11 Nov 1997
This book introduces GA from simple to advance.It gives you an overview of GA applications on search,optimization and machine learning.

The Best Book about Modern Cryptography, 11 Dec 2007
I used this book for a course on modern cryptography held by Prof. Persiano of the University of Salerno, Italy.
I read, consulted, and studied other books about cryptography, but 'INTRODUCTION TO MODERN CRYPTOGRAPHY' by Katz and Lindell is in my humble opinion THE BEST.
The book has a theoretical flavor, it is mathematically rigorous, but it is very readable and fluent, and presents the motivating discussions beneath each topic.
The book is fully self-contained, and gives the necessary background for each topic (for example there is a lot of basic computational number theory necessary for introducing the topic of 'public key').
The beauty of the book is in that the authors don't present a collection of protocols, with no links each other, but the flow is sequential and motivated (in contrast to books which present topics only for filling the pages).
All the theorems are proved and the treatment is rigorous, but the theory is developed from scratch, and the book is oriented to beginner students, though it presents also advanced stuff and is one of the most advanced book for beginners.
The main contents of the book are:

1) Perfect security and Shannon's theorem (information theoretic security)
2) Computational security, indistinguishability, CPA
3) Pseudorandomness
4) One-way functions, hard-core predicate, Levin's theorem
5) Message Authentication Codes
6) Costructions of Pseudorandom objects, AES, Substitution-Permutation networks
7) Relation between Private-Key, one-way functions and pseudrandomness.
8) Number theory for the cryptography
9) Computational number theory, factorization, square roots,discrete log,diffie-hellman problems
10) Public key, goldwasser-micali, el gamal, pallier, hybrid encryption, encryption schemes based on trapdoor permutations
11)Digital Signature Schemes
I wrote only some topics of the book following my taste, but the books contains much more.
The complete table of contents for this book is on the web site of the authors.
The exercises left to the end of each chapters are good, and vary from easy to hard.

I advice this book to everyone who wants start the study of modern cryptography from a theoretic and rigorous point of view.
After you read Katz and Lindell i suggest you to read "Foundations of Cryptography" by Goldreich, but it is too advanced and its reading requires you already read Katz and Lindell.

An essential purchase, simply exemplary., 13 Feb 2000
Combinatorics, in my experience, is never an easy subject to summarise - indeed, it has never before existed in such a readable form as is presented here by Balakrishnan. The text is generally excellent, bar a few minor faults or lack of depth regarding complex theory, and succeeds in its ambitious attempt to make the subject both approachable to the novice mathematician, and still worthwhile for the more informed, experienced reader. In my opinion, having studied Combinatorics in some depth during my degree programme, I can wholeheartedly recommend this introduction to Schaum, it is an invaluable reference guide, with as many questions posed to challenge the reader as those answered in some depth within the text. A truly brilliant realisation of an ambitious study, 'Outline of Combinatorics' is an excellent and refreshing approach to Schaum, and an essential purchase for the undergraduate and qualified mathematician alike. Superb.

Probably the greatest work in graph theory of all time, 08 Oct 2007
rigorous yet accessible - this book is the entire stimulus for my lov of graph theory, and indeed my research project.

Rewarding, but not easy, reading, 17 Dec 2000
Watts' innovative study of the small world phenomena has helped to revitalise this field of research, which had until recently been considered trivial in academic circles, material for anecdotes, rather than an important feature of network organisation. Watts shows how and why networks can be organised along small world principles, with examples as diverse as the spread of diseases (or gossip) through a population, the connectivity of worm's neural structures, and, infamously, the Kevin Bacon Game. While the book starts at a gentle pace, the mathematical detail soon becomes fairly dense, especially for those with little post-school mathematical training. However, the reader's perseverance is rewarded by Watts, who has provided a range of applications of small world theory, making this a must for anyone planning to study network organisation.

at the core of mathematics, 02 Feb 2006
this book deals in a friendly fashion with inequalities (and therefore) with the elementary use of convexity and integrals.
Famous inequalities bear the name of famous mathematicians, e.g: Tchebychev, Hilbert, Cauchy, Hardy, Rademacher...This is one way to understand their significance in maths. This book is about those ones and others such as 3/2 < a/(b+c) + b/(c+a) + c/(a+b) and the many ways to tackle with the fact of proving and using them. Study of this book should be seen as a good and rewarding path towards improving one's mathematical skill's

Great Book, 15 Feb 2005
This is an excellent book, which describes the mathematics of Go in a clear and concise way. However if the person buying this book is unfamiliar with Books such as "Winning Ways" and "On Numbers and Games", then he may find the idea of combinatorial game theory fairly abstract and meaningless. Nevertheless for anyone who is interested in Combinatorial Game theory and Go, this is a must have book.

Imagine being able to solve Go problems that the top proffessionals in the world cannot solve. One word of advice, be prepared to study hard, because this type of mathematics is very, very difficult. Still an excellent Book.

"What it says on the tin", 24 Sep 2004
The previous review is unfair. To quote the blurb: "Any Go player with an interest in mathematics or a mathematician interested in Go will not want to miss this book because it describes substantial connections between the two subjects which have been, until now, largely unrecognized."

How can you complain about a book relating Go and Mathematics actually containing Mathematics?

If any complaint is warranted it is that the book does not go into greater detail. I would say that any mathematician or person interested in writing a Go-playing program would be interested in this book.

For die hard people only, 21 Feb 2004
Mathematical Go is an intresting book if you are a die hard Go player with a mathematical brain. The book goes into depth the mathematic concepts of go as you would have gathered from the title. However for most of us who play go, the game is more of a hobby not a lesson in Math. I would not recommend you buying this book unless you have a serious intrest in Go AND Math

A high quality book for the specialist, 18 Jun 2001
The book gives a highly detailed account of how informative, and aesthetically pleasing, diagrams can be generated from underlying relationship information.

While a diagram can contain simple information, such a an artist's name and her/his lifespan, it may also contain this type of information for multiple artists involved with multiple disciplines. The problem, for the graphics designer, is to develop some form of encoding to represent this information. This book describes first of all what types of relationships can be illustrated in diagrams, and how, and then explains how more complex relations are made up of simpler ones, and thus can be constructed with the same sets of rules. Algorithms are given for generating the resulting diagrams automatically. The results are more than convincing.

This book is not for the faint-hearted, but if this field is of interest then it is an excellent academic book.

Dry and outdated, but cheap, 27 Apr 2004
This book offers a lot of content for a low price. That's the good thingabout it.
The bad thing is that it's difficult to read - it's very dry and boring.Of course, pretty much everything in mathematics is dry and boring, but Iknow lots of math books which teach far more efficiently than this one. Itgives too many examples and often doesn't go straight to the point, and itdidn't make it clear why the hell one would want to learn about grouptheory.
Also, the some notation used in this book is outdated, which is slightlyannoying at times as it just adds to the confusion of a confusing subject.

Great book for an introduction to graph theory., 11 Jun 2001
This book has all the information to get you through any graph theory course. The theory is explained well but the most helpfull is the hundreds of examples. There are a few examples on every topic in the book that are simple enough for anyone to read.

Vague and outdated., 12 Jun 2008
Although the author's style of writing is pleasant, the book leaves much to be desired.

Initially the most basic concepts are spelled out, and even derived in the early chapters, the later chapters stray from this, and some of the important results differ from the suggested derivation.

Admittedly no single website would provide as much information as clearly, and this book is a usefull start for those new to the field. But it should be read with critical attention to the details, and without any compunction about closing the book and getting on with the task in hand.

Perfect for getting started., 19 Dec 1999
I have a background in computing and biology but my maths is sketchy. I found this book a perfect practical introduction to the mathematical side - from basic principles to advanced GA theory. This book provides an exelent introduction to practical GA application. The first few chapters document a simple GA (SGA)written in Pascal (easily understandable to anyone with programming experience) to get you started. In all a very usefull book for those new to GA's.

Explains *and* entertains, 24 Apr 1999
I bought this book while I was a working professional. It is one of the few textbooks that I have ever read straight through, like a novel. In addition to making everything clear and interesting, the book was even funny at times! I didn't think that was allowed in textbooks. ;-)

a classic, 31 Jan 1999
Golberg's book is a classic in the field of genetic algorithms. It introduces the reader to the field of genetic algorithms in a clear and understandable manner, while at the same time maintaining a sense of scientific analysis and promise. If you are interested in the field, you should own this book.

Introduce GA and its applications gradually and clearly., 11 Nov 1997
This book introduces GA from simple to advance.It gives you an overview of GA applications on search,optimization and machine learning.

The Best Book about Modern Cryptography, 11 Dec 2007
I used this book for a course on modern cryptography held by Prof. Persiano of the University of Salerno, Italy.
I read, consulted, and studied other books about cryptography, but 'INTRODUCTION TO MODERN CRYPTOGRAPHY' by Katz and Lindell is in my humble opinion THE BEST.
The book has a theoretical flavor, it is mathematically rigorous, but it is very readable and fluent, and presents the motivating discussions beneath each topic.
The book is fully self-contained, and gives the necessary background for each topic (for example there is a lot of basic computational number theory necessary for introducing the topic of 'public key').
The beauty of the book is in that the authors don't present a collection of protocols, with no links each other, but the flow is sequential and motivated (in contrast to books which present topics only for filling the pages).
All the theorems are proved and the treatment is rigorous, but the theory is developed from scratch, and the book is oriented to beginner students, though it presents also advanced stuff and is one of the most advanced book for beginners.
The main contents of the book are:

1) Perfect security and Shannon's theorem (information theoretic security)
2) Computational security, indistinguishability, CPA
3) Pseudorandomness
4) One-way functions, hard-core predicate, Levin's theorem
5) Message Authentication Codes
6) Costructions of Pseudorandom objects, AES, Substitution-Permutation networks
7) Relation between Private-Key, one-way functions and pseudrandomness.
8) Number theory for the cryptography
9) Computational number theory, factorization, square roots,discrete log,diffie-hellman problems
10) Public key, goldwasser-micali, el gamal, pallier, hybrid encryption, encryption schemes based on trapdoor permutations
11)Digital Signature Schemes
I wrote only some topics of the book following my taste, but the books contains much more.
The complete table of contents for this book is on the web site of the authors.
The exercises left to the end of each chapters are good, and vary from easy to hard.

I advice this book to everyone who wants start the study of modern cryptography from a theoretic and rigorous point of view.
After you read Katz and Lindell i suggest you to read "Foundations of Cryptography" by Goldreich, but it is too advanced and its reading requires you already read Katz and Lindell.

An essential purchase, simply exemplary., 13 Feb 2000
Combinatorics, in my experience, is never an easy subject to summarise - indeed, it has never before existed in such a readable form as is presented here by Balakrishnan. The text is generally excellent, bar a few minor faults or lack of depth regarding complex theory, and succeeds in its ambitious attempt to make the subject both approachable to the novice mathematician, and still worthwhile for the more informed, experienced reader. In my opinion, having studied Combinatorics in some depth during my degree programme, I can wholeheartedly recommend this introduction to Schaum, it is an invaluable reference guide, with as many questions posed to challenge the reader as those answered in some depth within the text. A truly brilliant realisation of an ambitious study, 'Outline of Combinatorics' is an excellent and refreshing approach to Schaum, and an essential purchase for the undergraduate and qualified mathematician alike. Superb.

Probably the greatest work in graph theory of all time, 08 Oct 2007
rigorous yet accessible - this book is the entire stimulus for my lov of graph theory, and indeed my research project.

Rewarding, but not easy, reading, 17 Dec 2000
Watts' innovative study of the small world phenomena has helped to revitalise this field of research, which had until recently been considered trivial in academic circles, material for anecdotes, rather than an important feature of network organisation. Watts shows how and why networks can be organised along small world principles, with examples as diverse as the spread of diseases (or gossip) through a population, the connectivity of worm's neural structures, and, infamously, the Kevin Bacon Game. While the book starts at a gentle pace, the mathematical detail soon becomes fairly dense, especially for those with little post-school mathematical training. However, the reader's perseverance is rewarded by Watts, who has provided a range of applications of small world theory, making this a must for anyone planning to study network organisation.

at the core of mathematics, 02 Feb 2006
this book deals in a friendly fashion with inequalities (and therefore) with the elementary use of convexity and integrals.
Famous inequalities bear the name of famous mathematicians, e.g: Tchebychev, Hilbert, Cauchy, Hardy, Rademacher...This is one way to understand their significance in maths. This book is about those ones and others such as 3/2 < a/(b+c) + b/(c+a) + c/(a+b) and the many ways to tackle with the fact of proving and using them. Study of this book should be seen as a good and rewarding path towards improving one's mathematical skill's

Great Book, 15 Feb 2005
This is an excellent book, which describes the mathematics of Go in a clear and concise way. However if the person buying this book is unfamiliar with Books such as "Winning Ways" and "On Numbers and Games", then he may find the idea of combinatorial game theory fairly abstract and meaningless. Nevertheless for anyone who is interested in Combinatorial Game theory and Go, this is a must have book.

Imagine being able to solve Go problems that the top proffessionals in the world cannot solve. One word of advice, be prepared to study hard, because this type of mathematics is very, very difficult. Still an excellent Book.

"What it says on the tin", 24 Sep 2004
The previous review is unfair. To quote the blurb: "Any Go player with an interest in mathematics or a mathematician interested in Go will not want to miss this book because it describes substantial connections between the two subjects which have been, until now, largely unrecognized."

How can you complain about a book relating Go and Mathematics actually containing Mathematics?

If any complaint is warranted it is that the book does not go into greater detail. I would say that any mathematician or person interested in writing a Go-playing program would be interested in this book.

For die hard people only, 21 Feb 2004
Mathematical Go is an intresting book if you are a die hard Go player with a mathematical brain. The book goes into depth the mathematic concepts of go as you would have gathered from the title. However for most of us who play go, the game is more of a hobby not a lesson in Math. I would not recommend you buying this book unless you have a serious intrest in Go AND Math

Fascinating though incomplete, 06 Nov 2008
This book kept me busy for a while.
It is quite old, and limits itself to flat polyominoes, but apart from those shortcomings it was a fascinating work.

A high quality book for the specialist, 18 Jun 2001
The book gives a highly detailed account of how informative, and aesthetically pleasing, diagrams can be generated from underlying relationship information.

While a diagram can contain simple information, such a an artist's name and her/his lifespan, it may also contain this type of information for multiple artists involved with multiple disciplines. The problem, for the graphics designer, is to develop some form of encoding to represent this information. This book describes first of all what types of relationships can be illustrated in diagrams, and how, and then explains how more complex relations are made up of s