Marknadens största urval
Fri frakt över 199 kr
Snabb leverans
Hjälp
Logga in
  1. Hem
  2. Böcker
  3. Företagande & lärande
  4. Data & IT
  5. Computational Complexity of Counting and Sampling

Computational Complexity of Counting and Sampling

av Istvan (Renyi Institute Miklos

del av Discrete Mathematics and Its Applications-serien

Computational Complexity of Counting and Sampling av Istvan (Renyi Institute Miklos
Om Computational Complexity of Counting and Sampling

The purpose of the book is to give a comprehensive and detailed introduction to the computational complexity of counting and sampling. The book consists of three main topics: I. Counting problems that are solvable in polynomial running time, II. Approximation algorithms for counting and sampling, III. Holographic algorithms.

Visa mer
  • Språk:
  • Engelska
  • ISBN:
  • 9781138035577
  • Format:
  • Häftad
  • Sidor:
  • 408
  • Utgiven:
  • 20. februari 2019
  • Mått:
  • 233x158x23 mm.
  • Vikt:
  • 600 g.
  I lager
Leveranstid: 4-7 vardagar
Förväntad leverans: 13. november 2024

Om Istvan (Renyi Institute Miklos

Se alla böcker av Istvan (Renyi Institute Miklos

Beskrivning av Computational Complexity of Counting and Sampling

The purpose of the book is to give a comprehensive and detailed introduction to the computational complexity of counting and sampling. The book consists of three main topics: I. Counting problems that are solvable in polynomial running time, II. Approximation algorithms for counting and sampling, III. Holographic algorithms.

Användarnas betyg av Computational Complexity of Counting and Sampling



Andra köpte även...
Hitta liknande böcker
Boken Computational Complexity of Counting and Sampling finns i följande kategorier:

Gör som tusentals andra bokälskare

Prenumerera på vårt nyhetsbrev för att få fantastiska erbjudanden och inspiration för din nästa läsning.