Travelled to:1 × Iceland
1 × Italy
1 × USA
1 × United Kingdom
Collaborated with:∅ A.A.Bulatov V.Dalmau A.Atserias J.K.Fichte Y.Chen M.Weyer
Talks about:complex (2) count (2) understand (1) algorithm (1) subgraph (1) sharpsat (1) isomorph (1) implicit (1) descript (1) approxim (1)
Person: Marc Thurley
DBLP: Thurley:Marc
Contributed to:
2013
2009
20082006Wrote 4 papers:
- CSL-2013-BulatovDT #approximate #complexity
- Descriptive complexity of approximate counting CSPs (AAB, VD, MT), pp. 149–164.
- SAT-2009-AtseriasFT #algorithm #bound
- Clause-Learning Algorithms with Many Restarts and Bounded-Width Resolution (AA, JKF, MT), pp. 114–127.
- ICALP-A-2008-ChenTW #complexity #comprehension #morphism
- Understanding the Complexity of Induced Subgraph Isomorphisms (YC, MT, MW), pp. 587–596.
- SAT-2006-Thurley #component #modelling #named
- sharpSAT — Counting Models with Advanced Component Caching and Implicit BCP (MT), pp. 424–429.