Subject
Mathematics (miscellaneous)
Reference50 articles.
1. L. Adleman and K. Manders, “Diophantine Complexity,” in Foundations of Computer Science: Proc. 17th Annu. Symp., Houston, TX, Oct. 25–27, 1976 (IEEE, New York, 1976), pp. 81–88.
2. G. E. Andrews, “EYPHKA! num = Δ + Δ + Δ,” J. Number Theory 23(3), 285–293 (1986).
3. The Millennium Prize Problems, Ed. by J. Carlson, A. Jaffe, and A. Wiles (Am. Math. Soc., Providence, RI; Clay Math. Inst., Cambridge, MA, 2006); http://www.claymath.org/library/monographs/MPP.pdf
4. G. J. Chaitin, Algorithmic Information Theory (Cambridge Univ. Press, Cambridge, 1987).
5. Contemp. Math.;G. Cornelissen,2000
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Uncomputability and complexity of quantum control;Scientific Reports;2020-01-27
2. Julia Robinson numbers;International Journal of Number Theory;2019-08-19