Computer Science – Computational Complexity
Scientist
Computer Science
Computational Complexity
Scientist
A Polynomial Diophantine Generator Function for Integer Residuals
A polynomial time (heuristic) SAT algorithm
Computing a Discrete Logarithm in O(n^3)
Computing a Frobenius Coin Problem decision problem in O(n^2)
Computing an Integer Prime Factoring in O(n^2.5)
No associations
LandOfFree
Charles Sauerbier does not yet have a rating. At this time, there are no reviews or comments for this scientist.
If you have personal experience with Charles Sauerbier, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Charles Sauerbier will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-P-258052