Marc Thurley

According to our database, Marc Thurley authored at least 11 papers between 2006 and 2013.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2013

Descriptive complexity of approximate counting CSPs.

Andrei A. Bulatov, Víctor Dalmau, Marc Thurley

Proceedings of the Computer Science Logic 2013 (CSL 2013), 2013

2012

Computing hypergraph width measures exactly.

Lukas Moll, Siamak Tazari, Marc Thurley

Inf. Process. Lett., 2012

An Approximation Algorithm for #k-SAT.

Marc Thurley

Proceedings of the 29th International Symposium on Theoretical Aspects of Computer Science, 2012

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

Alistair Sinclair, Piyush Srivastava, Marc Thurley

Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms, 2012

2011

Clause-Learning Algorithms with Many Restarts and Bounded-Width Resolution.

Albert Atserias, Johannes Klaus Fichte, Marc Thurley

J. Artif. Intell. Res., 2011

2010

A Complexity Dichotomy for Partition Functions with Mixed Signs.

Leslie Ann Goldberg, Martin Grohe, Mark Jerrum, Marc Thurley

SIAM J. Comput., 2010

The Complexity of Partition Functions on Hermitian Matrices

Marc Thurley

CoRR, 2010

2009

Counting Homomorphisms and Partition Functions.

Martin Grohe, Marc Thurley

Proceedings of the Model Theoretic Methods in Finite Combinatorics, 2009

2008

Understanding the Complexity of Induced Subgraph Isomorphisms.

Yijia Chen, Marc Thurley, Mark Weyer

Proceedings of the Automata, Languages and Programming, 35th International Colloquium, 2008

2007

Kernelizations for Parameterized Counting Problems.

Marc Thurley

Proceedings of the Theory and Applications of Models of Computation, 2007

2006

sharpSAT - Counting Models with Advanced Component Caching and Implicit BCP.

Marc Thurley

Proceedings of the Theory and Applications of Satisfiability Testing, 2006