Counting curves and their projections

DOI10.1145/167088.167292MaRDI QIDQ5248552zbMATH OpenOpenAlexFDO

Authors Joachim von zur Gathen, Marek Karpinski, Igor E. Shparlinski

Publication date 7 May 2015

Published in Proceedings of the twenty-fifth annual ACM symposium on Theory of computing - STOC '93 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/167088.167292

Mathematics Subject Classification ID

Computational aspects of algebraic curves (14Q05) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Analysis of algorithms and problem complexity (68Q25) Symbolic computation and algebraic computation (68W30)

Cited in

(3)

• Zeta functions, one-way functions, and pseudorandom number generators.
• The computational complexity of recognizing permutation functions
• Detecting lacunary perfect powers and computing their roots

This page was built for publication: Counting curves and their projections

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5248552)