Definitions from Wikipedia (Schaefer's dichotomy theorem)

▸ noun:  In computational complexity theory, a branch of computer science, Schaefer's dichotomy theorem, proved by Thomas Jerome Schaefer, states necessary and sufficient conditions under which a finite set S of relations over the Boolean domain yields polynomial-time or NP-complete problems when the relations of S are used to constrain some of the propositional variables.


▸ Words similar to schaefer's dichotomy theorem
▸ Usage examples for schaefer's dichotomy theorem

▸ Idioms related to schaefer's dichotomy theorem
▸ Wikipedia articles (New!)
▸ Words that often appear near schaefer's dichotomy theorem
▸ Rhymes of schaefer's dichotomy theorem

▸ Invented words related to schaefer's dichotomy theorem