Product
Help
Pricing
About
Jobs
Log in
Get started
Author
Add to collection
Charles Sauerbier
Observed names:
Sauerbier, C.,
Sauerbier, Charles
OpenAlex ID:
A5091098666
Three complete deterministic polynomial algorithms for 3SAT
2002
·
Sauerbier, Charles
·
arXiv (Cornell University)
·
2
PDF
Factoring Odd Integers without Multiplication and Division
2017
·
Sauerbier, Charles
·
arXiv (Cornell University)
PDF
Prime Factoring and The Complexity Of
2016
·
Sauerbier, Charles
·
arXiv (Cornell University)
PDF
A Polynomial Diophantine Generator Function for Integer Residuals
2010
·
Sauerbier, Charles
·
arXiv (Cornell University)
PDF
Computing a Frobenius Coin Problem decision problem in O(n^2)
2010
·
Sauerbier, Charles
·
arXiv (Cornell University)
PDF
Discovery of Elliptic Curve Cryptographic Private Key in O(n)
2009
·
Sauerbier, Charles
·
arXiv (Cornell University)
PDF
Computing an Integer Prime Factoring in O(n^2.5)
2009
·
Sauerbier, Charles
·
arXiv (Cornell University)
PDF
Computing the Prime Factoring of an Integer in O(n^4)
2009
·
Charles Sauerbier
·
arXiv (Cornell University)
Computing a Discrete Logarithm in O(n^3)
2009
·
Sauerbier, Charles
·
arXiv (Cornell University)
PDF
Cantor's Problem
2009
·
Charles Sauerbier
·
arXiv (Cornell University)
Establishing Countable Nature of Real Numbers (By constructive proof)
2009
·
Charles Sauerbier
·
arXiv (Cornell University)
Answering Hilbert's 1st Problem
2009
·
Sauerbier, Charles
·
arXiv (Cornell University)
PDF
Does NP not equal P?
2002
·
Sauerbier, C.
·
arXiv (Cornell University)
PDF
Mathematical basis for polySAT implication operator
2002
·
Sauerbier, Charles
·
arXiv (Cornell University)
PDF
Does P = NP?
2002
·
Sauerbier, C.
·
arXiv (Cornell University)
PDF
A Polynomial Time SAT Algorithm
2002
·
Charles Sauerbier
·
arXiv (Cornell University)
A polynomial time (heuristic) SAT algorithm
2002
·
Charles Sauerbier
·
arXiv (Cornell University)
Show more works
View as search
Works count:
22
Citation count:
2
H-index:
1
I10-index:
Year
Topic
Type
