Abstract
We consider the satisfiability problem on Boolean formulas in conjunctive normal form. We show that a satisfying assignment of a formula can be found in polynomial time with a success probability of 2 − n(1−1/(1+log m)) , where n and m are the number of variables and the number of clauses of the formula, respectively. If the number of clauses of the formulas is bounded by n c for some constant c, this gives an expected run time of O( p( n)·2 n(1−1/(1+ clog n)) ) for a polynomial p.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
