1 citations · 1 across the 12 of their papers we have counts for
4 papers · 1 filter
Does NP not equal P?
C. Sauerbier
Stephen Cook posited SAT is NP-Complete in 1971. If SAT is NP-Complete then, as is generally accepted, any polynomial solution of it must also present a polynomial solution of all…
Does P = NP?
C. Sauerbier
This paper considers the question of P = NP in context of the polynomial time SAT algorithm. It posits proposition dependent on existence of conjectured problem that even where the…
Mathematical basis for polySAT implication operator
Charles Sauerbier
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 mathematic…
Three complete deterministic polynomial algorithms for 3SAT
Charles Sauerbier
Three algorithms are presented that determine the existence of satisfying assignments for 3SAT Boolean satisfiability expressions. One algorithm is presented for determining an ins…