System Experiments Laboratory  

Go Back   System Experiments Laboratory > Mathematics > Computational Complexity Theory

Reply
 
Thread Tools Display Modes
  #1  
Old 08-23-2019
selroc selroc is offline
Administrator
 
Join Date: Aug 2019
Location: ROME
Posts: 92
Default The Maximum satisfiability problem

In computational complexity theory, the maximum satisfiability problem (MAX-SAT) is the problem of determining the maximum number of clauses, of a given Boolean formula in conjunctive normal form, that can be made true by an assignment of truth values to the variables of the formula. It is a generalization of the Boolean satisfiability problem, which asks whether there exists a truth assignment that makes all clauses true.

Link: https://en.wikipedia.org/wiki/Maximu...bility_problem
Reply With Quote
Reply


Currently Active Users Viewing This Thread: 1 (0 members and 1 guests)
 
Thread Tools
Display Modes

Posting Rules
You may not post new threads
You may not post replies
You may not post attachments
You may not edit your posts

BB code is On
Smilies are On
[IMG] code is On
HTML code is Off



All times are GMT +2. The time now is 09:33 PM.


Powered by vBulletin® Version 3.8.11
Copyright ©2000 - 2019, vBulletin Solutions Inc.
(c) 2019 System Experiments Laboratory