• Open Daily: 10am - 10pm
    Alley-side Pickup: 10am - 7pm

    3038 Hennepin Ave Minneapolis, MN
    612-822-4611

Open Daily: 10am - 10pm | Alley-side Pickup: 10am - 7pm
3038 Hennepin Ave Minneapolis, MN
612-822-4611
Polya Counting Theory: Combinatorics for Computer Science

Polya Counting Theory: Combinatorics for Computer Science

Paperback

General Mathematics

ISBN10: 1481100890
ISBN13: 9781481100892
Publisher: Createspace
Published: Nov 29 2012
Pages: 66
Weight: 0.39
Height: 0.14 Width: 8.50 Depth: 11.00
Language: English
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.

Also in

General Mathematics