Algorithmic number theory. Second international symposium, ANTS-II, Talence, France, May 18-23, 1996. Proceedings

DOI10.1007/3-540-61581-4zbMath0852.00023OpenAlexW2501812802MaRDI QIDQ1920209

No author found.

Publication date: 21 August 1996

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-61581-4

zbMATH Keywords

ProceedingsSymposiumNumber theoryAlgorithmic number theoryTalence (France)ANTS-II

Mathematics Subject Classification ID

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 (1)

Computing discrete logarithms in high-genus hyperelliptic Jacobians in provably subexponential time

This page was built for publication: Algorithmic number theory. Second international symposium, ANTS-II, Talence, France, May 18-23, 1996. Proceedings