Complexity Dichotomies for Counting Problems: Volume 1, Boolean Domain
-10%
portes grátis
Complexity Dichotomies for Counting Problems: Volume 1, Boolean Domain
Cai, Jin-Yi; Chen, Xi
Cambridge University Press
11/2017
470
Dura
Inglês
9781107062375
15 a 20 dias
770
Descrição não disponível.
1. Counting problems; 2. Fibonacci gates and Holant problems; 3. Boolean #CSP; 4. Matchgates and holographic algorithms; 5. 2-spin systems on regular graphs; 6. Holant problems and #CSP; 7. Holant dichotomy for symmetric constraints; 8. Planar #CSP for symmetric constraints; 9. Planar Holant for symmetric constraints; 10. Dichotomies for asymmetric constraints.
Este título pertence ao(s) assunto(s) indicados(s). Para ver outros títulos clique no assunto desejado.
1. Counting problems; 2. Fibonacci gates and Holant problems; 3. Boolean #CSP; 4. Matchgates and holographic algorithms; 5. 2-spin systems on regular graphs; 6. Holant problems and #CSP; 7. Holant dichotomy for symmetric constraints; 8. Planar #CSP for symmetric constraints; 9. Planar Holant for symmetric constraints; 10. Dichotomies for asymmetric constraints.
Este título pertence ao(s) assunto(s) indicados(s). Para ver outros títulos clique no assunto desejado.
