Faster deterministic integer factorisation David Harvey (joint work with Edgar Costa, NYU) University of New South Wales 25th October 2011

First Page		Document Content
Date: 2011-10-24 19:42:20 Applied mathematics Integer factorization General number field sieve Quadratic sieve Time complexity Lenstra elliptic curve factorization Factorization Prime number Algorithm Theoretical computer science Integer factorization algorithms Mathematics		Faster deterministic integer factorisation David Harvey (joint work with Edgar Costa, NYU) University of New South Wales 25th October 2011 Add to Reading List Source URL: web.maths.unsw.edu.au Download Document from Source Website File Size: 218,56 KB Share Document on Facebook

	SCAN 2018 Post-conference Proceedings Special Issue of Journal of Computational and Applied Mathematics Call for Papers Special Issue on the 18th International Symposium on Scientific Computing, Computer Arithmetic, DocID: 1xVSx - View Document
	Performance Evaluation and Optimization Models for Processing Networks with Queue-Dependent Production Quantities by John S. Hollywood S.B. Applied Mathematics DocID: 1xVdz - View Document
	Mixture Density Networks Christopher M. Bishop Neural Computing Research Group Dept. of Computer Science and Applied Mathematics Aston University DocID: 1xUJf - View Document
	Mathematics_BS_Applied.pdf DocID: 1xTYO - View Document
	A BOOTSTRAP INTERVAL ESTIMATOR FOR BAYES’ CLASSIFICATION ERROR Chad M. Hawes and Carey E. Priebe Johns Hopkins University Department of Applied Mathematics and Statistics Baltimore, MDABSTRACT DocID: 1vrMQ - View Document