Skip to search formSkip to main contentSkip to account menu

Schaefer's dichotomy theorem

In computational complexity theory, a branch of computer science, Schaefer's dichotomy theorem states necessary and sufficient conditions under which… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2015
2015
We prove a complexity dichotomy for complex-weighted Holant problems with an arbitrary set of symmetric constraint functions on… 
Highly Cited
2007
Highly Cited
2007
Abstract The Mercury Dual Imaging System (MDIS) on the MESSENGER spacecraft will provide critical measurements tracing Mercury’s… 
Highly Cited
2006
Highly Cited
2006
[1] The surface of Mars appears dramatically different between the northern and southern hemispheres. Any endogenic origin for… 
Highly Cited
2004
Highly Cited
2004
Verbs can be introduced (merged) in either a lexical VP or a functional head, the latter position giving rise to restructuring… 
2002
2002
Varios artropodos predadores polifagos estao disponiveis para uso em controle biologico pelo aumento da populacao, com o objetivo… 
1997
1997
Schaefer (1978) introduced a generalized satisfiability problem SAT(S) and showed that, depending on the nature of relations in S… 
Highly Cited
1992
Highly Cited
1992
Sequences (644-681 bp) from the mitochondrial cytochrome b gene were obtained for 24 individuals representing the geographic…