Pensum -10%
Hopp til hovedinnholdet
Computational Complexity of Counting and Sampling
Av Istvan Miklos, 2019.Del av serien Discrete Mathematics and Its Applications.
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.
Språk: Engelsk
3 189,-
Ikke tilgjengelig for Klikk&Hent
Midlertidig tomt på lager
Bestillingsvare. Forventes sendt om ca 10 dager
Computational Complexity of Counting and Sampling
Av Istvan Miklos, 2019.Del av serien Discrete Mathematics and Its Applications.
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.
3 189,-
Språk: Engelsk
Ikke tilgjengelig for Klikk&Hent
Midlertidig tomt på lager
Bestillingsvare. Forventes sendt om ca 10 dager
3 189,-
Ved å fullføre kjøpet aksepterer du kjøpsvilkårene.
