تقرير
The 2-MAXSAT Problem Can Be Solved in Polynomial Time
| العنوان: | The 2-MAXSAT Problem Can Be Solved in Polynomial Time |
|---|---|
| المؤلفون: | Chen, Yangjun |
| سنة النشر: | 2023 |
| المجموعة: | Computer Science |
| مصطلحات موضوعية: | Computer Science - Computational Complexity |
| الوصف: | By the MAXSAT problem, we are given a set $V$ of $m$ variables and a collection $C$ of $n$ clauses over $V$. We will seek a truth assignment to maximize the number of satisfied clauses. This problem is $\textit{NP}$-hard even for its restricted version, the 2-MAXSAT problem by which every clause contains at most 2 literals. In this paper, we discuss an efficient algorithm to solve this problem. Its average time complexity is bounded by O($n^2m^4). This shows that the 2-MAXSAT problem can be solved in polynomial time. Comment: The paper contains errors |
| نوع الوثيقة: | Working Paper |
| URL الوصول: | http://arxiv.org/abs/2304.12517 |
| رقم الأكسشن: | edsarx.2304.12517 |
| قاعدة البيانات: | arXiv |
| الوصف غير متاح. |