Tasuta kohaletoimetamine tellimustele üle 29 €
  • check 10+ miljonit raamatut
  • check Uued tooted iga päev
  • check Meid usaldab üle 1 miljoni kliendi
  • check Hea hind ja allahindlused
  • check Tarne üle kogu Euroopa

Polya Counting Theory Combinatorics for Computer Science - S. Williamson

inglise keel
2012-11-29
5,36 € 8,93 €

-40% koodiga BOOKS

Meie tarnija laos

Saadetis 10-16 tööpäeva jooksul

30-päevane tagastamisõigus

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 ... Täielik kirjeldus

Võib-olla meeldib sulle ka

Kirjeldus

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.

Lisateave

Autor S. Williamson
Kirjastaja CreateSpace Independent Publishing Platform
Väljalaskeaasta 2012
Kaanetüüp Pehme kaanega
EAN 9781481100892
Kirjuta oma arvustus
Te vaatate: Polya Counting Theory Combinatorics for Computer Science
Teie hinnang:

Goodreads'i arvustused

5,36 € 8,93 €