Author of the publication

Approximation algorithms for two-state anti-ferromagnetic spin systems on bounded degree graphs

, , and . CoRR, (2011)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

An Approximation Algorithm for #k-SAT. CoRR, (2011)Descriptive complexity of approximate counting CSPs., , and . CSL, volume 23 of LIPIcs, page 149-164. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2013)The Complexity of Partition Functions on Hermitian Matrices. CoRR, (2010)A complexity dichotomy for partition functions with mixed signs, , , and . CoRR, (2008)Approximation algorithms for two-state anti-ferromagnetic spin systems on bounded degree graphs, , and . CoRR, (2011)An Approximation Algorithm for #k-SAT.. STACS, volume 14 of LIPIcs, page 78-87. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2012)sharpSAT - Counting Models with Advanced Component Caching and Implicit BCP.. SAT, volume 4121 of Lecture Notes in Computer Science, page 424-429. Springer, (2006)Counting Homomorphisms and Partition Functions., and . AMS-ASL Joint Special Session, volume 558 of Contemporary Mathematics, page 243-292. American Mathematical Society, (2009)A Complexity Dichotomy for Partition Functions with Mixed Signs., , , and . SIAM J. Comput., 39 (7): 3336-3402 (2010)Kernelizations for Parameterized Counting Problems.. TAMC, volume 4484 of Lecture Notes in Computer Science, page 703-714. Springer, (2007)