![](https://dblp.org/img/logo.ua.320x120.png)
![](https://dblp.org/img/dropdown.dark.16x16.png)
![](https://dblp.org/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.org/img/search.dark.16x16.png)
![search dblp](https://dblp.org/img/search.dark.16x16.png)
default search action
Marc Thurley
Person information
Refine list
![note](https://dblp.org/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2014
- [i7]Albert Atserias, Johannes Klaus Fichte, Marc Thurley:
Clause-Learning Algorithms with Many Restarts and Bounded-Width Resolution. CoRR abs/1401.3868 (2014) - 2013
- [c9]Andrei A. Bulatov, Víctor Dalmau
, Marc Thurley:
Descriptive complexity of approximate counting CSPs. CSL 2013: 149-164 - 2012
- [j3]Lukas Moll, Siamak Tazari, Marc Thurley:
Computing hypergraph width measures exactly. Inf. Process. Lett. 112(6): 238-242 (2012) - [c8]Alistair Sinclair, Piyush Srivastava, Marc Thurley:
Approximation algorithms for two-state anti-ferromagnetic spin systems on bounded degree graphs. SODA 2012: 941-953 - [c7]Marc Thurley:
An Approximation Algorithm for #k-SAT. STACS 2012: 78-87 - 2011
- [j2]Albert Atserias, Johannes Klaus Fichte, Marc Thurley:
Clause-Learning Algorithms with Many Restarts and Bounded-Width Resolution. J. Artif. Intell. Res. 40: 353-373 (2011) - [i6]Martin Grohe, Marc Thurley:
Counting Homomorphisms and Partition Functions. CoRR abs/1104.0185 (2011) - [i5]Lukas Moll, Siamak Tazari, Marc Thurley:
Computing hypergraph width measures exactly. CoRR abs/1106.4719 (2011) - [i4]Marc Thurley:
An Approximation Algorithm for #k-SAT. CoRR abs/1107.2001 (2011) - [i3]Alistair Sinclair, Piyush Srivastava, Marc Thurley:
Approximation algorithms for two-state anti-ferromagnetic spin systems on bounded degree graphs. CoRR abs/1107.2368 (2011) - 2010
- [j1]Leslie Ann Goldberg, Martin Grohe
, Mark Jerrum, Marc Thurley:
A Complexity Dichotomy for Partition Functions with Mixed Signs. SIAM J. Comput. 39(7): 3336-3402 (2010) - [i2]Marc Thurley:
The Complexity of Partition Functions on Hermitian Matrices. CoRR abs/1004.0992 (2010)
2000 – 2009
- 2009
- [c6]Martin Grohe, Marc Thurley:
Counting Homomorphisms and Partition Functions. AMS-ASL Joint Special Session 2009: 243-292 - [c5]Albert Atserias, Johannes Klaus Fichte, Marc Thurley:
Clause-Learning Algorithms with Many Restarts and Bounded-Width Resolution. SAT 2009: 114-127 - [c4]Leslie Ann Goldberg, Martin Grohe, Mark Jerrum, Marc Thurley:
A Complexity Dichotomy for Partition Functions with Mixed Signs. STACS 2009: 493-504 - 2008
- [c3]Yijia Chen, Marc Thurley, Mark Weyer:
Understanding the Complexity of Induced Subgraph Isomorphisms. ICALP (1) 2008: 587-596 - [i1]Leslie Ann Goldberg, Martin Grohe, Mark Jerrum, Marc Thurley:
A complexity dichotomy for partition functions with mixed signs. CoRR abs/0804.1932 (2008) - 2007
- [c2]Marc Thurley:
Kernelizations for Parameterized Counting Problems. TAMC 2007: 703-714 - 2006
- [c1]Marc Thurley:
sharpSAT - Counting Models with Advanced Component Caching and Implicit BCP. SAT 2006: 424-429
Coauthor Index
![](https://dblp.org/img/cog.dark.24x24.png)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:42 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint