The latest articles on DEV Community by Unknown (@unknown_54d6ff44213776b51). https://dev.to/unknown_54d6ff44213776b51 https://media2.dev.to/dynamic/image/width=90,height=90,fit=cover,gravity=auto,format=auto/https:%2F%2Fdev-to-uploads.s3.us-east-2.amazonaws.com%2Fuploads%2Fuser%2Fprofile_image%2F4191970%2Fbf6b5741-04fb-4bf5-8aa4-9eb79c4cf7fa.png https://dev.to/unknown_54d6ff44213776b51 en Unknown Sun, 18 Oct 2026 11:32:44 +0000 https://dev.to/unknown_54d6ff44213776b51/heres-why-i-think-this-polynomial-time-sat-solver-concept-is-correct-4i16 https://dev.to/unknown_54d6ff44213776b51/heres-why-i-think-this-polynomial-time-sat-solver-concept-is-correct-4i16 <p><a href="https://gist.githubusercontent.com/user1852963074/d60d7432121592cc5cd4dcf82b963a03/raw/31171a9776318cd92e5dad35f796c0e4df536335/text.txt" rel="noopener noreferrer">Algorithm concept</a></p> <p>I've been working on a polynomial-time SAT solver concept for over a year. Here are the reasons why I think this concept is correct:</p> <ol> <li>Doesn't use the resolution rule (which is proven to be exponential).</li> <li>Directly solves the forgetting problem of DPLL.</li> <li>Uses Conflict Tree to prevent re-exploring conflicting branches.</li> </ol> algorithms computerscience