SAT or the Boolean Satisfiability Problem is a well known problem in computer science; it is the problem of finding whether a solution exists for a given boolean formula in polynomial time bounded by the length of the input. If there exists a set of assignments of True values that satisfy a given formula, this formula is said to be 'satisfiable.' The SAT problem is widely known because no algorithm has been developed that can efficiently solve SAT problems in polynomial time. 


Our SATsolver can provide a complete set of assignments to the most complex Boolean formulas. Using a novel binary logic system, we are able to significantly reduce the complexity of SAT.

Copy of Copy of Untitled.jpg