Abstract
This paper presents a perspective on a previously studied heuristic tree search algorithm for the NP-complete “3SAT” satisfiability problem, which synthesizes results by Brown, Franco, Purdom, and others. It is shown that when an a priori calculation indicates a random, nontrivial 3SAT formula is very likely unsatisfiable, then the heuristic algorithm is expected to prove unsatisfiability in a search tree with size essentially independent of the problem size, and bounded by a constant that depends only on the ratio of the number of clauses to the cube of the number of variables.
Sign-in/Register to access full text options 
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.
