articole
(gol)
Contact
Cont 
Generating functions, one of the most important tools in enumerative combinatorics, are a bridge between discrete mathematics and continuous analysis. Generating functions have numerous applications in mathematics, especially in: Combinatorics; Probability Theory; Statistics; Theory of Markov...
citește totul
Generating functions, one of the most important tools in enumerative combinatorics, are a bridge between discrete mathematics and continuous analysis. Generating functions have numerous applications in mathematics, especially in: Combinatorics; Probability Theory; Statistics; Theory of Markov Chains; and Number Theory.
ascunde descrierea
- Editură: Taylor & Francis Inc
- Cod:
- Anul publicării: 2005
- Limba: Engleză
- Legarea: Legată
- Număr de pagini: 192
- Lățimea ambalajului: 15.9 cm
- Înălțimea ambalajului: 23.8 cm
- Adâncimea ambalajului: 1.9 cm
- Greutatea ambalajului: 512 g
Recenzii