Polya Counting Theory: Combinatorics for Computer Science
Format:
Paperback
En stock
0.36 kg
Sí
Nuevo
Amazon
USA
- 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.
IMPORTÁ FACIL
Comprando este producto podrás descontar el IVA con tu número de RUT
NO CONSUME FRANQUICIA
Si tu carrito tiene solo libros o CD’s, no consume franquicia y podés comprar hasta U$S 1000 al año.