They demonstrated that Boolean Satisfiability problem can be solved in polynomial time.

They demonstrated that if there is a polynomial solution to the Boolean problem, then all NP Complete problems can be solved in polynomial time.

They demonstrated that certain problems were able to be translated to Boolean Satisfiability Problem in Polynomial time.

They used Boolean Satisfiability Problem to demonstrate that the Clique Problem has a polynomial solution