Mathematical basis for polySAT implication operator
Computational Complexity
2007-05-23 v1 Logic in Computer Science
Abstract
The mathematical basis motivating the "implication operator" of the polySAT algorithm and its function is examined. Such is not undertaken with onerous rigor of symbolic mathematics; a more intuitive visual appeal being employed to present some of the mathematical premises underlying function of the implication operator.
Cite
@article{arxiv.cs/0208026,
title = {Mathematical basis for polySAT implication operator},
author = {Charles Sauerbier},
journal= {arXiv preprint arXiv:cs/0208026},
year = {2007}
}
Comments
7 pages, 7 figures. Keywords: algorithms, complexity, computation theory, satisfiability, group theory, field theory, set theory