1 citations · 1 across the 12 of their papers we have counts for
Showing cs.DSShow all
3 papers · 1 filter
cs.DS2010
Computing a Frobenius Coin Problem decision problem in O(n^2)
Charles Sauerbier
Expanding on recent results of another an algorithm is presented that provides solution to the Frobenius Coin Problem in worst case O(n^2) in the magnitude of the largest denominat…
cs.DS2009
Computing a Discrete Logarithm in O(n^3)
Charles Sauerbier
This paper presents a means with time complexity of at worst O(n^3) to compute the discrete logarithm on cyclic finite groups of integers modulo p. The algorithm makes use of reduc…
cs.DS2009
Computing an Integer Prime Factoring in O(n^2.5)
Charles Sauerbier
Paper is withdrawn. On review the paper contributes little of significance. The runtime analysis of the algorithms presented, while correct in terms of number of operations, does n…