Skip to search formSkip to main contentSkip to account menu

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… 
Wikipedia (opens in a new tab)

Related topics

Related topics

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

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… 
2016
2016
Energy-Aware Real-Time Task Scheduling on Local/Shared Memory Systems
The rapid development of the Internet of Things (IoT) has increased the requirement on the processing capabilities of sensors… 
2014
2014
On Subexponential and FPT-Time Inapproximability
Fixed-parameter algorithms, approximation algorithms and moderately exponential algorithms are three major approaches to… 
2010
2010
Learning the Large-Scale Structure of the MAX-SAT Landscape Using Populations
A new algorithm for solving maximum satisfiability (MAX-SAT) problems is introduced which clusters good solutions, and restarts… 
Highly Cited
2007
Highly Cited
2007
On Pseudorandom Generators with Linear Stretch in NC0
Abstract.We consider the question of constructing cryptographic pseudorandom generators (PRGs) in NC0, namely ones in which each… 
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… 
Highly Cited
2003
Highly Cited
2003
Approximation Hardness of Short Symmetric Instances of MAX-3SAT
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… 
1998
1998
Approximation Algorithms for PSPACE-Hard Hierarchically and Periodically Specified Problems
We study the efficient approximability of basic graph and logic problems in the literature when instances are specified… 
Highly Cited
1995
Highly Cited
1995
Linearity testing in characteristic two
Let Dist(f,g)=Pr/sub u/ [f(u)/spl ne/g(u)] denote the relative distance between functions f,g mapping from a group G to a group H… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)