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
Parallelization of Genetic Algorithm to Solve MAX-3SAT Problem on GPUs
A 
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… 
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… 
2012
2012
Circumventing d-to-1 for Approximation Resistance of Satisfiable Predicates Strictly Containing Parity of Width Four - (Extended Abstract)
Hastad established that any predicate P ⊆ {0,1} m containing parity of width at least three is approximation resistant for almost… 
2009
2009
Optimally increasing secure connectivity in multihop wireless ad hoc networks
We consider the problem of how to maximize secure connectivity of multi-hop wireless ad hoc networks after deployment. Two… 
2006
2006
Notes for Lecture 12
In the last lecture we described the construction of the zigzag product of graphs and completed the analysis of its expansion… 
2005
2005
Cs270 Combinatorial Algorithms & Data Structures 19.1 Approximation Algorithms 19.2 Vertex Cover
Approximation algorithms are used when we know a problem is hard. It is a way to consider optimization versions of function… 
2004
2004
Applying Strong Components Detection to Max 3 SAT
The problem of maximum satisfiability is an NP-Complete problem, which means that a deterministic algorithm for solving it in… 
2001
2001
A Machine Model for the Complexity of NP-Approximation Problems
  • Richard Chang
  • Current Trends in Theoretical Computer Science
  • 2001
  • Corpus ID: 9356322
This paper investigates a machine-based model for the complexity of approximating the CLIQUE problem. The model consists of… 
1993
1993
Comparative studies of constraint satisfaction and Davis-Putnam algorithms for maximum satisfiability problems
Maximum satissability (MAX-SAT) is an extension of satissability (SAT), in which a partial solution is sought that satisses the… 
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)