The following pages link to Marc Thurley (Q437684):
Displaying 13 items.
- Computing hypergraph width measures exactly (Q437685) (← links)
- Approximation algorithms for two-state anti-ferromagnetic spin systems on bounded degree graphs (Q2511522) (← links)
- (Q2904751) (← links)
- Descriptive Complexity of approximate counting CSPs (Q2958520) (← links)
- (Q3118386) (← links)
- (Q3188969) (← links)
- Understanding the Complexity of Induced Subgraph Isomorphisms (Q3521949) (← links)
- (Q5390002) (← links)
- A Complexity Dichotomy for Partition Functions with Mixed Signs (Q5390598) (← links)
- Kernelizations for Parameterized Counting Problems (Q5425483) (← links)
- (Q5743449) (← links)
- Clause-Learning Algorithms with Many Restarts and Bounded-Width Resolution (Q5894155) (← links)
- Clause-Learning Algorithms with Many Restarts and Bounded-Width Resolution (Q5902141) (← links)