# MAX-3SAT

## Papers overview

Semantic Scholar uses AI to extract papers important to this topic.

2019

2019

- AAAI
- 2019

This paper proposes a new algorithm for solving MAX2SAT problems based on combining search methods with semidefinite programming… (More)

Is this relevant?

2015

2015

- 2015

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

- RAIRO - Operations Research
- 2007

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

- J. Artif. Intell. Res.
- 2007

Exact Max-SAT solvers, compared with SAT solvers, apply little inference at each node of the proof tree. Commonly used SAT… (More)

Is this relevant?

2005

2005

- Int. Arab J. Inf. Technol.
- 2005

The MAXimum propositional SATisfiability problem (MAXSAT) is a well known NP-hard optimization problem with many theoretical and… (More)

Is this relevant?

2005

2005

- 2005

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

- Electronic Colloquium on Computational Complexity
- 2003

Is this relevant?

Highly Cited

2003

Highly Cited

2003

- CP
- 2003

For the last ten years, a significant amount of work in the constraint community has been devoted to the improvement of complete… (More)

Is this relevant?

2002

2002

- Theor. Comput. Sci.
- 2002

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

- J. Algorithms
- 2000

The (unweighted) Maximum Satisfiability problem (MaxSat) is: given a boolean formula in conjunctive normal form, find a truth… (More)

Is this relevant?