MAX-3SAT

Known as: MAX-3SAT(13), MAX3SAT 
MAX-3SAT is a problem in the computational complexity subfield of computer science. It generalises the Boolean satisfiability problem (SAT) which is… (More)
Wikipedia

Related topics

Related topics

14 relations
(SAT, ε-UNSAT)APXApproximation algorithmBoolean satisfiability problem
(More)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2019
2019
Low-rank semidefinite programming for the MAX2SAT problem
This paper proposes a new algorithm for solving MAX2SAT problems based on combining search methods with semidefinite programming… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2015
2015
Exact algorithms for max-2sat and max-3sat via multidimensional matrix multiplication
In this thesis it is showed how an O(n4− ) algorithm for the cube multiplication problem (that is defined in the thesis) would… (More)
Is this relevant?
2007
2007
1.0957-Approximation Algorithm for Random MAX-3SAT
We prove that MAX-3SAT can be approximated in polynomial time within a factor 1.0957 on random instances. 
Is this relevant?
Highly Cited
2007
Highly Cited
2007
New Inference Rules for Max-SAT
Exact Max-SAT solvers, compared with SAT solvers, apply little inference at each node of the proof tree. Commonly used SAT… (More)
  • figure 2
  • figure 4
  • figure 5
  • figure 6
  • figure 7
Is this relevant?
2005
2005
Solving the Maximum Satisfiability Problem Using an Evolutionary Local Search Algorithm
The MAXimum propositional SATisfiability problem (MAXSAT) is a well known NP-hard optimization problem with many theoretical and… (More)
  • table 2
  • table 1
  • figure 2
  • figure 3
Is this relevant?
2005
2005
Constraint Satisfaction Problems Chapter 5 Sections 1 – 3
Constraint Satisfaction Problems In the previous note, we learned how to find optimal solutions to search problems, a type of… (More)
Is this relevant?
Highly Cited
2003
Highly Cited
2003
Approximation Hardness of Short Symmetric Instances of MAX-3SAT
 
Is this relevant?
Highly Cited
2003
Highly Cited
2003
Solving Max-SAT as Weighted CSP
For the last ten years, a significant amount of work in the constraint community has been devoted to the improvement of complete… (More)
  • table 1
  • table 2
  • figure 1
Is this relevant?
2002
2002
MAX3SAT is exponentially hard to approximate if NP has positive dimension
Under the hypothesis that NP has positive p-dimension, we prove that any approximation algorithm A for MAX3SAT must satisfy at… (More)
Is this relevant?
Highly Cited
2000
Highly Cited
2000
New Upper Bounds for Maximum Satisfiability
The (unweighted) Maximum Satisfiability problem (MaxSat) is: given a boolean formula in conjunctive normal form, find a truth… (More)
  • table 1
  • table 2
Is this relevant?