Talk:Schaefer's dichotomy theorem

	Mathematics portal This article is within the scope of WikiProject Mathematics, a collaborative effort to improve the coverage of mathematics on Wikipedia. If you would like to participate, please visit the project page, where you can join the discussion and see a list of open tasks.MathematicsWikipedia:WikiProject MathematicsTemplate:WikiProject Mathematicsmathematics articles
Low	This article has been rated as Low-priority on the project's priority scale.

Computer science Low‑importance

This article is within the scope of WikiProject Computer science, a collaborative effort to improve the coverage of Computer science related articles on Wikipedia. If you would like to participate, please visit the project page, where you can join the discussion and see a list of open tasks.Computer scienceWikipedia:WikiProject Computer scienceTemplate:WikiProject Computer scienceComputer science articles

Low

This article has been rated as Low-importance on the project's importance scale.

Things you can help WikiProject Computer science with:

Here are some tasks awaiting attention:

Article requests :
- Requested articles/Applied arts and sciences/Computer science, computing, and Internet
Cleanup :
- Computer science articles needing attention
- Computer science articles needing expert attention
Copyedit :
- Computing
Expand :
- Computer science
Infobox :
- Computer science articles without infoboxes
Maintain :
- Timeline of computing 2020–present
Photo :
- Find pictures for the biographies of computer scientists (see List of computer scientists)
- Computing articles needing images
Stubs :
- Computer science stubs
Unreferenced :
- WikiProject Computer science/Unreferenced BLPs
Project-related :
- Tag all relevant articles in Category:Computer science and sub-categories with {{WikiProject Computer science}}

Untitled

I replaced the reference to the Bulatov-Dalmau paper with the reference to the Creignou-Hermann paper, where dichotomy result for counting boolean CSP appears first. — Preceding unsigned comment added by 193.55.176.1 (talk) 15:28, 7 March 2013 (UTC)[reply]

That’s right. However, the section needs more reorganization: the Creignou and Hermann #SAT dichotomy is simply that the affine case is in P, and everything else is #P-complete. The stuff about Mal'tsev polynomials (which comes from the Bulatov and Dalmau paper) is only relevant for non-Boolean CSP’s, but then it is no longer a sufficient condition.—Emil J. 16:58, 7 March 2013 (UTC)[reply]

I've taken a crack at this reorganization, splitting into binary and nonbinary paragraphs and citing the relevant paper in each. Erik Demaine (talk) 00:01, 17 November 2023 (UTC)[reply]