Maximum satisfiability problem: Revision history

Jump to navigation Jump to search

Diff selection: Mark the radio buttons of the revisions to compare and hit enter or the button at the bottom.
Legend: (cur) = difference with latest revision, (prev) = difference with preceding revision, m = minor edit.

29 December 2024

  • curprev 03:3603:36, 29 December 2024 imported>Whoever10 m 13,500 bytes +13,500 clarified that MAX-SAT is NP-hard as a decision problem. it's said in the same sentence that it's OptP-complete, while OptP and NP belong to different contexts
Retrieved from "https://en.wiki.beta.math.wmflabs.org/wiki/Maximum_satisfiability_problem"