Polya Counting Theory: Combinatorics for Computer Science - Tapa blanda

Williamson, S. Gill

 
9781481100892: Polya Counting Theory: Combinatorics for Computer Science

Sinopsis

The beautiful mathematical counting theory due originally to George Pólya is developed and extended in this unit of study. We discuss many extensions of the classical results of Pólya and address problems of actually constructing systems of distinct representatives under the constraints of symmetry. We focus on mathematical concepts as well as on the vizualization of algorithms through the use of graphical and pictorial methods.

"Sinopsis" puede pertenecer a otra edición de este libro.

Reseña del editor

The beautiful mathematical counting theory due originally to George Pólya is developed and extended in this unit of study. We discuss many extensions of the classical results of Pólya and address problems of actually constructing systems of distinct representatives under the constraints of symmetry. We focus on mathematical concepts as well as on the vizualization of algorithms through the use of graphical and pictorial methods.

"Sobre este título" puede pertenecer a otra edición de este libro.