Leonard Gojer, B.S. Computer Science, University of Texas,   Dallas, Prateek Swamy, B.S. Computer Science      Abstract – The prior consensus among computer scientists for the past 50 years or more has been that the NP-Complete problems have no polynomial order time solutions. An important part of that existing body of Computer Science theory is … Continue reading An Improvement on the Solution of Circuit Satisfiability Applicable to Solving the Question of Whether P=NP