Computer Science – Computational Complexity
Scientific paper
2002-08-18
Computer Science
Computational Complexity
7 pages, 7 figures. Keywords: algorithms, complexity, computation theory, satisfiability, group theory, field theory, set theo
Scientific paper
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.
No associations
LandOfFree
Mathematical basis for polySAT implication operator does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Mathematical basis for polySAT implication operator, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Mathematical basis for polySAT implication operator will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-462109