Charles Sauerbier

List of publications from the DBLP Bibliography Server - FAQ
Other views: by type - by year (modern) - classic-C

Ask others: ACM DL/Guide -

	2010
i8		Charles Sauerbier: Computing a Frobenius Coin Problem decision problem in O(n^2). CoRR abs/1001.0961 (2010)
i7		Charles Sauerbier: A Polynomial Diophantine Generator Function for Integer Residuals. CoRR abs/1001.2752 (2010)
	2009
i6		Charles Sauerbier: Cantor's Problem. CoRR abs/0912.0228 (2009)
i5		Charles Sauerbier: Computing a Discrete Logarithm in O(n^3). CoRR abs/0912.2269 (2009)
i4		Charles Sauerbier: Computing the Prime Factoring of an Integer in O(n^4). CoRR abs/0912.4084 (2009)
i3		Charles Sauerbier: Discovery of Elliptic Curve Cryptographic Private Key in O(n). CoRR abs/0912.4694 (2009)
	2002
i2		Charles Sauerbier: A polynomial time (heuristic) SAT algorithm. CoRR cs.CC/0205064 (2002)
i1		Charles Sauerbier: Mathematical basis for polySAT implication operator. CoRR cs.CC/0208026 (2002)

Last update Sun May 26 00:57:20 2013 CET by the DBLP Team —

Data released under the ODC-BY 1.0 license — See also our legal information page