Computational Complexity of Counting and Sampling
af Istvan (Renyi Institute Miklos
Bog, Paperback, Engelsk, 2019
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.
Priser fra 4 boghandlere
- BoghandlerPrisFragtLevering
- SAXO849,95 kr.Gratis fragtUkendtKøb for 849,95 kr.Køb
- Bogreolen1.036,95 kr.0,00 kr.4-7 hverdageKøb for 1.036,95 kr.Køb
- Tales1.037,95 kr.34,95 kr.4-7 hverdageKøb for 1.037,95 kr.Køb
- Pling BØGER1.037,95 kr.34,95 kr.4-7 hverdageKøb for 1.037,95 kr.Køb
Bogdetaljer
- SprogEngelsk
- IndbindingPaperback
- ISBN9781138035577
- Udgivet20/02/2019
- Udgivet afTaylor & Francis Ltd
- Længde408 sider
- ForfatterIstvan (Renyi Institute Miklos
- GenreBusiness og læring, Computer og IT