Mathematical basis for polySAT implication operator

Simple item page
dc.creatorSauerbier, Charles
dc.date2002-08-18
dc.date.accessioned2026-07-07T03:18:48Z
dc.date.available2026-07-07T03:18:48Z
dc.descriptionThe 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.
dc.description7 pages, 7 figures. Keywords: algorithms, complexity, computation theory, satisfiability, group theory, field theory, set theory
dc.identifierhttps://arxiv.org/abs/cs/0208026
dc.identifierhttp://arxiv.org/abs/cs/0208026
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/31262
dc.subjectComputational Complexity
dc.subjectLogic in Computer Science
dc.subjectF.2.2;F.1.1
dc.titleMathematical basis for polySAT implication operator
dc.typetext

Files

Collections

arXiv