Abstract
the existing two models are modified to give SDRRKS model, where SDRRKS model generates strictly d-regular random (k, s)-CNF formulas. Let F be a strictly d-regular random (3, s)-CNF formula such that d fixes, then there exists a real number so such that F is unsatisfiable with high probability when s > so. The conclusion is consistent with the existing one when d is even. The simulated experiments in this paper verify the conclusion well. The research possibly helps generate random hard instances of the 3-SAT problem.
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.
