Generatingfunctionology

Prijzen vanaf
65,13

Uitgelicht

VERGELIJK ALLE AANBIEDERS (3)

Beschrijving

Bol Generating functions, one of the most important tools in enumerative combinatorics, are a bridge between discrete mathematics and continuous analysis. 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 - Number Theory One of the most important and relevant recent applications of combinatorics lies in the development of Internet search engines whose incredible capabilities dazzle even the mathematically trained user.

Vergelijk aanbieders (3)

Shop
Prijs
Verzendkosten
Totale prijs
65,13
Gratis
65,13
Naar shop
Gratis Shipping Costs
65,13
Gratis
65,13
Naar shop
Gratis Shipping Costs
68,87
Gratis
68,87
Naar shop
Gratis Shipping Costs
Beschrijving (2)
Bol

Generating functions, one of the most important tools in enumerative combinatorics, are a bridge between discrete mathematics and continuous analysis. 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 - Number Theory One of the most important and relevant recent applications of combinatorics lies in the development of Internet search engines whose incredible capabilities dazzle even the mathematically trained user.

Amazon

Pages: 256, Edition: 3, Hardcover, A K Peters/CRC Press


Productspecificaties

Merk CRC Press
EAN
  • 9781568812793
Maat

Prijzen voor het laatst bijgewerkt op:

Uitgelichte Keuze
65,13
Naar shop