Find link

language:

Find link is a tool written by Edward Betts.

searching for Algorithmic Number Theory Symposium 7 found (15 total)

alternate case: algorithmic Number Theory Symposium

Number Theory Foundation (266 words) [view diff] exact match in snippet view article find links to article

methods. The NTF funds the Selfridge prize awarded at each Algorithmic Number Theory Symposium (ANTS) and is a regular supporter of several conferences

Andrew Sutherland (mathematician) (1,794 words) [view diff] exact match in snippet view article

V. (2013). "Isogeny volcanoes". Proceedings of the Tenth Algorithmic Number Theory Symposium (ANTS X). Vol. 1. Mathematical Sciences Publishers. pp. 507–530

Generation of primes (1,158 words) [view diff] exact match in snippet view article find links to article

Paul (1994). Improved Incremental Prime Number Sieves. Algorithmic Number Theory Symposium. pp. 280–288. CiteSeerX 10.1.1.52.835. Plaisted D. A. (1979)

Decisional Diffie–Hellman assumption (1,120 words) [view diff] exact match in snippet view article find links to article

Decision Diffie-Hellman problem". Proceedings of the Third Algorithmic Number Theory Symposium. Lecture Notes in Computer Science. Vol. 1423. pp. 48–63

Binary GCD algorithm (1,993 words) [view diff] exact match in snippet view article find links to article

Binary GCD Like Algorithms for Some Complex Quadratic Rings. Algorithmic Number Theory Symposium. Burlington, VT, USA. pp. 57–71. doi:10.1007/978-3-540-24847-7_4

Computational complexity of mathematical operations (1,576 words) [view diff] exact match in snippet view article find links to article

O(M(n)\log n)} algorithm for the Jacobi symbol". International Algorithmic Number Theory Symposium. Springer. pp. 83–95. arXiv:1004.2091. doi:10.1007/978-3-642-14518-6_10

P-group generation algorithm (5,396 words) [view diff] exact match in snippet view article find links to article

(2006). Computing pro-p Galois groups. Proceedings of the 7th Algorithmic Number Theory Symposium 2006, Lecture Notes in Computer Science 4076, 1-10, Springer