Abstract
Abstract Abstract In this paper, we show that the Fourier-Motzkin elimination procedure can be used to solve instances of Quantified 2SAT problems without resorting to modulo arithmetic or congruences. The closure of 2SAT formulae under the elimination procedure allows us to conclude that integer programs which are similarly closed can be solved in polynomial time, using this procedure.
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.
