On the Arithmetic Complexity of Euler Function

DOI10.1007/978-3-642-20712-9_4zbMath1330.68088OpenAlexW115078676MaRDI QIDQ3007615

Manindra Agrawal

Publication date: 17 June 2011

Published in: Computer Science – Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-20712-9_4

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Randomized algorithms (68W20)

Cites Work

• Valiant's model and the cost of computing integers
• PRIMES is in P
• FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science
• Unnamed Item

This page was built for publication: On the Arithmetic Complexity of Euler Function