Algorithmic number theory. 1st international symposium, ANTS-I, Ithaca, NY, USA, May 6-9, 1994. Proceedings
From MaRDI portal
Publication:1339732
zbMATH Open0802.00018MaRDI QIDQ1339732FDOQ1339732
Authors:
Publication date: 6 December 1994
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Recommendations
- Algorithmic number theory. Second international symposium, ANTS-II, Talence, France, May 18-23, 1996. Proceedings
- Algorithmic number theory. 3rd international symposium, ANTS-III, Portland, OR, USA, June 21--25, 1998. Proceedings
- Algorithmic number theory. 4th international symposium. ANTS-IV, Leiden, the Netherlands, July 2--7, 2000. Proceedings
- Algorithmic number theory. 6th international symposium, ANTS-VI, Burlington, VT, USA, June 13--18, 2004. Proceedings.
- Algorithmic number theory. 5th international symposium, ANTS-V, Sydney, Australia, July 7--12, 2002. Proceedings
- Algorithmic number theory. 7th international symposium, ANTS-VII, Berlin, Germany, July 23--28, 2006. Proceedings.
- Algorithmic number theory. 8th international symposium, ANTS-VIII Banff, Canada, May 17--22, 2008 Proceedings
- ANTS XIV. Proceedings of the fourteenth algorithmic number theory symposium, Auckland, New Zealand, virtual event, June 29 -- July 4, 2020
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)
Cited In (7)
- Algorithmic number theory. 7th international symposium, ANTS-VII, Berlin, Germany, July 23--28, 2006. Proceedings.
- Smooth ideals in hyperelliptic function fields
- Algorithmic number theory. 6th international symposium, ANTS-VI, Burlington, VT, USA, June 13--18, 2004. Proceedings.
- On the deterministic complexity of factoring polynomials
- Algorithmic number theory. 8th international symposium, ANTS-VIII Banff, Canada, May 17--22, 2008 Proceedings
- 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
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1339732)