Glyph Algorithm - SPAZKEY LLC

Glyph Algorithm - SPAZKEY LLC

The Glyph Algorithm is a solution to a case of the Boolean Satisfiability problem (k-SAT) and is therefore capable of determining satisfiable interpretations to any given Boolean expression in conjunctive normal form. Unlike tactics utilized by what are presently considered to be the most efficient algorithms for solving SAT, Glyph does not rely on collision detection and backtracking operations as a means of decreasing computational complexity. Rather, the glyph algorithm solves SAT by reducing a given Boolean expression to a new format, known as Glyph form, such that it is absent of the issue normal SAT solvers have in accounting for variable repetition. In doing so, both what operators represent and how these representations are affected by variable repetition are able to be acknowledged with minimal computational effort. This results in an algorithm which is capable of solving k-SAT with a drastically heightened degree of efficiency in comparison to currently available high performing SAT solvers.

Read More