Two-Dimensional Indirect Binary Search for the Positive One-in-Three Satisfiability Problem
Data Structures and Algorithms
2017-09-19 v2 Artificial Intelligence
Computational Complexity
Discrete Mathematics
Combinatorics
Abstract
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.
Cite
@article{arxiv.1708.08377,
title = {Two-Dimensional Indirect Binary Search for the Positive One-in-Three Satisfiability Problem},
author = {Shunichi Matsubara},
journal= {arXiv preprint arXiv:1708.08377},
year = {2017}
}
Comments
This version added a subsection for describing the idea of the algorithm