Maximum satisfiability problem: Revision history

Jump to navigation Jump to search
Template:FlatlistExternal tools:

Template:Endflatlist

For any version listed below, click on its date to view it. For more help, see Help:Page history and Help:Edit summary. (cur) = difference from current version, (prev) = difference from preceding version, m = minor edit, → = section edit, ← = automatic edit summary

29 December 2024

  • curprev 02:3602: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 "http://debianws.lexgopc.com/wiki143/index.php?title=Maximum_satisfiability_problem"