Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

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… Expand
Wikipedia

Related topics

Related topics

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

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
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… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 5
  • figure 4
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… Expand
  • figure 4
  • figure 5
  • figure 6
  • figure 7
  • figure 8
Is this relevant?
2007
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… Expand
  • figure 1
Is this relevant?
Highly Cited
2003
Highly Cited
2003
Approximation Hardness of Short Symmetric Instances of MAX-3SAT
 
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… Expand
  • table 1
  • table 2
Is this relevant?
Highly Cited
1998
Highly Cited
1998
Free Bits, PCPs, and Nonapproximability-Towards Tight Results
This paper continues the investigation of the connection between probabilistically checkable proofs (PCPs) and the… Expand
Is this relevant?
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… Expand
  • figure 4.2
Is this relevant?
Highly Cited
1996
Highly Cited
1996
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… Expand
  • figure 1
Is this relevant?
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… Expand
  • figure 1
Is this relevant?
Highly Cited
1993
Highly Cited
1993
Eecient Probabilistically Checkable Proofs and Applications to Approximation
We construct multi-prover proof systems for NP which use only a constant number of provers to simultaneously achieve low error… Expand
  • figure 1
Is this relevant?
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy, Terms of Service, and Dataset License
ACCEPT & CONTINUE