Author:
Gnang Edinah K.,Radziwiłł Maksym,Sanna Carlo
Funder
National Science Foundation
Subject
Discrete Mathematics and Combinatorics
Reference15 articles.
1. On defining integers and proving arithmetic circuit lower bounds;Bürgisser;Comput. Complexity,2009
2. On the ultimate complexity of factorials;Cheng;Theoret. Comput. Sci.,2004
3. On asymptotic estimates for arithmetic cost functions;de~A. Moreira;Proc. Amer. Math. Soc.,1997
4. The cost of computing integers;de~Melo;Proc. Amer. Math. Soc.,1996
5. E.K. Gnang, Integer formula encoding SageTex package, arXiv:1407.0039.
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. On the Tower Factorization of Integers;The American Mathematical Monthly;2024-03-29