Algorithmic number theory. 1st international symposium, ANTS-I, Ithaca, NY, USA, May 6-9, 1994. Proceedings
From MaRDI portal
Publication:1339732
zbMath0802.00018MaRDI QIDQ1339732
No author found.
Publication date: 6 December 1994
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Analysis of algorithms and problem complexity (68Q25) Proceedings of conferences of miscellaneous specific interest (00B25) Proceedings, conferences, collections, etc. pertaining to number theory (11-06) Computational number theory (11Yxx)
Related Items (4)
Smooth ideals in hyperelliptic function fields ⋮ On the deterministic complexity of factoring polynomials ⋮ Computing discrete logarithms in high-genus hyperelliptic Jacobians in provably subexponential time ⋮ Sieving in Function Fields
This page was built for publication: Algorithmic number theory. 1st international symposium, ANTS-I, Ithaca, NY, USA, May 6-9, 1994. Proceedings
