Sublinear-Space Approximation Algorithms for Max r-SAT
نویسندگان
چکیده
In the \(\textsc {Max} r\text {-}\textsc {SAT}{}\) problem, input is a CNF formula with n variables where each clause disjunction of at most r literals. The objective to compute an assignment which satisfies as many clauses possible. While there are polynomial-time approximation algorithms for this we take viewpoint space complexity following [Biswas et al., Algorithmica 2021] and design sublinear-space problem.
منابع مشابه
Approximation Algorithms for MAX SAT
Maximum Satisfiability Problem (MAX SAT) is one of the most natural optimization problems. It is known to be NP-hard. Hence, approximation algorithms have been considered. The aim of this survey is to show recent developments of approximation algorithms for MAX SAT. We will confine ourselves to approximation algorithms with theoretical performance guarantees. For other approximation algorithms ...
متن کاملImproved Approximation Algorithms for MAX NAE-SAT and MAX SAT
MAX SAT and MAX NAE-SAT are central problems in theoretical computer science. We present an approximation algorithm for MAX NAE-SAT with a conjectured performance guarantee of 0.8279. This improves a previously conjectured performance guarantee of 0.7977 of Zwick [Zwi99]. Using a variant of our MAX NAE-SAT approximation algorithm, combined with other techniques used in [Asa03], we obtain an app...
متن کاملOn Approximation Algorithms for Hierarchical MAX-SAT
We prove upper and lower bounds on performance guarantees of approximation algorithms for the Hierarchical MAX-SAT (H-MAX-SAT) problem. This problem is representative of a broad class of PSPACE-hard problems involving graphs, Boolean formulas and other structures that are de ned succinctly. Our rst result is that for some constant < 1, it is PSPACE-hard to approximate the function H-MAX-SAT to ...
متن کاملNew 3⁄4 - Approximation Algorithms for MAX SAT
Recently, Yannakakis presented the rst 3 4-approximation algorithm for the Maximum Satissability Problem (MAX SAT). His algorithm makes non-trivial use of solutions to maximum ow problems. We present new, simple 3 4-approximationalgorithmsthat apply the probabilistic method/randomized rounding to the solution to a linear programming relaxation of MAX SAT. We show that although standard randomiz...
متن کاملOn Some Recent MAX SAT Approximation Algorithms
Recently a number of randomized 3 4 -approximation algorithms for MAX SAT have been proposed that all work in the same way: given a fixed ordering of the variables, the algorithm makes a random assignment to each variable in sequence, in which the probability of assigning each variable true or false depends on the current set of satisfied (or unsatisfied) clauses. To our knowledge, the first su...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Lecture Notes in Computer Science
سال: 2021
ISSN: ['1611-3349', '0302-9743']
DOI: https://doi.org/10.1007/978-3-030-89543-3_11