Schaefer's dichotomy theorem

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

Topic mentions per year

Topic mentions per year

1992-2017
051019922017

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2013
2013
[1] A fundamental long-standing question regarding Mars history is whether the flat and low-lying northern plains ever hosted an… (More)
Is this relevant?
2012
2012
Generalising and unifying the known theorems for difference and differential fields, it is shown that for every finite free S… (More)
Is this relevant?
2011
2011
We propose and explore a novel alternative framework to study the complexity of counting problems, called Holant problems… (More)
  • figure 3.1
  • figure 4.1
  • figure 5.1
  • figure 5.2
  • figure 5.3
Is this relevant?
2011
2011
Cognitive Informatics (CI) is a transdisciplinary enquiry of computer science, information sciences, cognitive science, and… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • table 1
Is this relevant?
2010
2010
Jupiter’s large moons Ganymede1,2 and Callisto2,3 are similar in size and composition. However, Ganymede has a tectonically… (More)
  • table 1
  • figure 2
Is this relevant?
2007
2007
Isosta.tica,lly compensated crusta,1 thickness variations and associated topographic contrasts a,t the surface of a planet result… (More)
  • figure 1
  • figure 2
  • table 1
  • figure 3
  • figure 5
Is this relevant?
Highly Cited
2005
Highly Cited
2005
Many natural combinatorial problems can be expressed as constraint satisfaction problems. This class of problems is known to be… (More)
  • figure 1.1
Is this relevant?
2004
2004
Schaefer proved in 1978 that the Boolean constraint satisfaction problem for a given constraint language is either in P or is… (More)
  • table 1
  • figure 1
Is this relevant?
1997
1997
We study the complexity of generalized satissability problem for formulas whose variables occur at most twice. We prove a… (More)
Is this relevant?
Highly Cited
1995
Highly Cited
1995
The paper is an exercise in descriptive ontology, with specific applications to problems in the geographical sphere. It presents… (More)
Is this relevant?