Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 210,064,137 papers from all fields of science
Search
Sign In
Create Free Account
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
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
14 relations
(SAT, ε-UNSAT)
APX
Approximation algorithm
Boolean satisfiability problem
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2019
2019
Low-rank semidefinite programming for the MAX2SAT problem
Po-Wei Wang
,
J. Z. Kolter
AAAI Conference on Artificial Intelligence
2019
Corpus ID: 56275808
This paper proposes a new algorithm for solving MAX2SAT problems based on combining search methods with semidefinite programming…
Expand
2016
2016
Energy-Aware Real-Time Task Scheduling on Local/Shared Memory Systems
Chenchen Fu
,
G. Călinescu
,
Kai Wang
,
Minming Li
,
C. Xue
IEEE Real-Time Systems Symposium
2016
Corpus ID: 21078333
The rapid development of the Internet of Things (IoT) has increased the requirement on the processing capabilities of sensors…
Expand
2014
2014
On Subexponential and FPT-Time Inapproximability
Édouard Bonnet
,
B. Escoffier
,
Eun Jung Kim
,
V. Paschos
Algorithmica
2014
Corpus ID: 2459800
Fixed-parameter algorithms, approximation algorithms and moderately exponential algorithms are three major approaches to…
Expand
2010
2010
Learning the Large-Scale Structure of the MAX-SAT Landscape Using Populations
Mohamed Qasem
,
A. Prügel-Bennett
IEEE Transactions on Evolutionary Computation
2010
Corpus ID: 8580444
A new algorithm for solving maximum satisfiability (MAX-SAT) problems is introduced which clusters good solutions, and restarts…
Expand
Highly Cited
2007
Highly Cited
2007
On Pseudorandom Generators with Linear Stretch in NC0
B. Applebaum
,
Y. Ishai
,
E. Kushilevitz
Computational Complexity
2007
Corpus ID: 646582
Abstract.We consider the question of constructing cryptographic pseudorandom generators (PRGs) in NC0, namely ones in which each…
Expand
Highly Cited
2007
Highly Cited
2007
New Inference Rules for Max-SAT
Chu Min Li
,
F. Manyà
,
Jordi Planes
Journal of Artificial Intelligence Research
2007
Corpus ID: 5094394
Exact Max-SAT solvers, compared with SAT solvers, apply little inference at each node of the proof tree. Commonly used SAT…
Expand
Highly Cited
2003
Highly Cited
2003
Approximation Hardness of Short Symmetric Instances of MAX-3SAT
P. Berman
,
M. Karpinski
,
A. Scott
Electron. Colloquium Comput. Complex.
2003
Corpus ID: 40181844
Highly Cited
2003
Highly Cited
2003
Solving Max-SAT as Weighted CSP
S. D. Givry
,
J. Larrosa
,
P. Meseguer
,
T. Schiex
International Conference on Principles and…
2003
Corpus ID: 7769266
For the last ten years, a significant amount of work in the constraint community has been devoted to the improvement of complete…
Expand
1998
1998
Approximation Algorithms for PSPACE-Hard Hierarchically and Periodically Specified Problems
M. Marathe
,
H. Hunt
,
R. Stearns
,
V. Radhakrishnan
SIAM journal on computing (Print)
1998
Corpus ID: 3204235
We study the efficient approximability of basic graph and logic problems in the literature when instances are specified…
Expand
Highly Cited
1995
Highly Cited
1995
Linearity testing in characteristic two
M. Bellare
,
D. Coppersmith
,
J. Håstad
,
Marcos A. Kiwi
,
M. Sudan
Proceedings of IEEE 36th Annual Foundations of…
1995
Corpus ID: 12913126
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
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)
ACCEPT & CONTINUE