Mathematical basis for polySAT implication operator
计算复杂性
2007-05-23 v1 计算机科学中的逻辑
摘要
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.
引用
@article{arxiv.cs/0208026,
title = {Mathematical basis for polySAT implication operator},
author = {Charles Sauerbier},
journal= {arXiv preprint arXiv:cs/0208026},
year = {2007}
}
备注
7 pages, 7 figures. Keywords: algorithms, complexity, computation theory, satisfiability, group theory, field theory, set theory