正三分之一可满足性问题的二维的间接二叉搜索
Two-Dimensional Indirect Binary Search for the Positive One-in-Three Satisfiability Problem
摘要:
本文提出了一种求解正三分之一可满足性问题(Pos1in3SAT)的算法。该算法利用二维二分搜索方法,在不构造指数数量赋值的情况下,可以有效地判定给定公式的所有赋值中是否存在满意赋值.
英文摘要:
In this paper, we propose an algorithm for the positive one-in-three satisfiability problem (Pos1in3SAT). The proposed algorithm can efficiently decide the existence of a satisfying assignment in all assignments for a given formula by using a 2-dimensional binary search method without constructing an exponential number of assignments.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。