Lower bound for the Complexity of the Boolean Satisfiability Problem
Computational Complexity
2016-04-15 v4
Abstract
This paper depicts algorithms for solving the decision Boolean Satisfiability Problem. An extreme problem is formulated to analyze the complexity of algorithms and the complexity for solving it. A novel and easy reformulation as a lottery for an extreme case is presented to determine a stable complexity around . The reformulation point out that the decision Boolean Satisfiability Problem can only be solved in exponential time. This implies there is not an efficient algorithm for the NP Class.
Cite
@article{arxiv.1602.06867,
title = {Lower bound for the Complexity of the Boolean Satisfiability Problem},
author = {Carlos Barrón-Romero},
journal= {arXiv preprint arXiv:1602.06867},
year = {2016}
}
Comments
arXiv admin note: text overlap with arXiv:1510.02682