Computational Complexity of Counting and Sampling
-10%
portes grátis
Computational Complexity of Counting and Sampling
Taylor & Francis Ltd
02/2019
390
Mole
Inglês
9781138035577
15 a 20 dias
Descrição não disponível.
1. Background on computational complexity 2. Algebraic dynamic programming and monotone computations 3. Linear algebraic algorithms. The power of subtracting 4. #P-complete counting problems 5. Holographic algorithms 6. Methods of random generations 7. Mixing of Markov chains and their applications in the theory of counting and sampling 8. Approximable counting and sampling problems
Este título pertence ao(s) assunto(s) indicados(s). Para ver outros títulos clique no assunto desejado.
1. Background on computational complexity 2. Algebraic dynamic programming and monotone computations 3. Linear algebraic algorithms. The power of subtracting 4. #P-complete counting problems 5. Holographic algorithms 6. Methods of random generations 7. Mixing of Markov chains and their applications in the theory of counting and sampling 8. Approximable counting and sampling problems
Este título pertence ao(s) assunto(s) indicados(s). Para ver outros títulos clique no assunto desejado.
