Template:Did you know nominations/2-satisfiability


 * The following is an archived discussion of the DYK nomination of the article below. Please do not modify this page. Subsequent comments should be made on the appropriate discussion page (such as |this nomination's talk page, the article's talk page or Wikipedia talk:Did you know), unless there is consensus to re-open the discussion at this page. No further edits should be made to this page.

The result was: promoted by Cwmhiraeth (talk) 05:51, 27 October 2016 (UTC)

2-satisfiability

 * ... that 2-satisfiability can be used to schedule round-robin tournaments so that teams alternate between home and away games as much or as little as possible? Source: See the "Scheduling" subsection of the article and its Miyashiro & Matsui (2005) reference. The main link for the reference is subscription-only but Semantic Scholar has a free online copy at https://pdfs.semanticscholar.org/0a31/9c6da6bdbc6a5ef1b07f874509dd462f3f0d.pdf.
 * Reviewed: Yale Institute of International Studies

Improved to Good Article status by David Eppstein (talk). Self-nominated at 00:08, 11 October 2016 (UTC).
 * Paint by numbers Animation.gifALT1 ... that 2SAT can help solve a nonogram (pictured)? As suggested on my talk by . —David Eppstein (talk) 02:28, 11 October 2016 (UTC)


 * Symbol confirmed.svg Congratulations with bringing 2-SAT to GA! The article is recently improved to Good Article, and timely nominated. Well referenced, interesting and neutral. Spot checks with Earwig's tool did not reveal close paraphrasing issues. Both hooks are short enough, neutral and interesting. The facts in the original hook are treated in a subsection under Scheduling in the article, cited directly after this subsection (which contains several sentences), and verified in cited reference. The facts from the ALT1 hook (solving of nonograms), is mentioned in the article, cited to peer-reviewed journal articles, and verified in online abstracts of the referenced articles. (It can be noted that the general problem of solving nonograms is NP-hard, but the phrase "can help solve" covers the fact that many nomograms can be transformed to 2-SAT and thus solved in polynomial time). Image license on Commons looks good. QPQ done. Oceanh (talk) 22:37, 14 October 2016 (UTC)