暂无分享,去创建一个
Sugata Sanyal | Imre Kiss | Siby Abraham | Mukund A. Sanglikar | S. Sanyal | Imre KISS | S. Abraham | M. Sanglikar | Siby Abraham
[1] Eitan M. Gurari,et al. Two-Way Counter Machines and Diophantine Equations , 1982, JACM.
[2] Peter Norvig,et al. Artificial Intelligence: A Modern Approach , 1995 .
[3] Zhiyu Shen,et al. An Empirical Study on Array Subscripts and Data Dependencies , 1989, ICPP.
[4] Ezra Brown,et al. Elliptic Curves from Mordell to Diophantus and Back , 2002, Am. Math. Mon..
[5] W. Daniel Hillis,et al. Co-evolving parasites improve simulated evolution as an optimization procedure , 1990 .
[6] R. Sridharan. Mathematics in Ancient and Medieval India , 2005 .
[7] Bjorn Poonen,et al. COMPUTING RATIONAL POINTS ON CURVES , 2001 .
[8] C. S. Yogananda. Fermat’s last theorem , 1996 .
[9] Kenneth H. Rosen. Elementary Number Theory: And Its Applications , 2010 .
[10] Richard K. Belew,et al. New Methods for Competitive Coevolution , 1997, Evolutionary Computation.
[11] Helmut Hasse,et al. Number Theory , 2020, An Introduction to Probabilistic Number Theory.
[12] Oscar H. Ibarra,et al. On two-way FA with monotonic counters and quadratic Diophantine equations , 2004, Theor. Comput. Sci..
[13] Sugata Sanyal,et al. To filter or to authorize , 2008 .
[14] A. L. Whiteman. Review: Ivan Niven and Herbert S. Zuckerman, An introduction to the theory of numbers , 1961 .
[15] Donald E. Knuth,et al. The art of computer programming. Vol.2: Seminumerical algorithms , 1981 .
[16] Martin D. Davis. Hilbert's Tenth Problem is Unsolvable , 1973 .
[17] I. Niven,et al. An introduction to the theory of numbers , 1961 .
[18] A. K. Bag,et al. Mathematics in ancient and medieval India , 1979 .
[19] Donald Ervin Knuth,et al. The Art of Computer Programming, Volume II: Seminumerical Algorithms , 1970 .
[20] E. Wright,et al. An Introduction to the Theory of Numbers , 1939 .
[21] Yuri Matiyasevich,et al. Hilbert’s tenth problem , 2019, 100 Years of Math Milestones.
[22] Chi-Sung Laih,et al. Cryptanalysis if a Diophantine Equation Oriented Public Key Cryptosystem , 1997, IEEE Trans. Computers.
[23] Two-way counter machines and Diophantine equations , 1981, 22nd Annual Symposium on Foundations of Computer Science (sfcs 1981).
[24] N. Koblitz. Introduction to Elliptic Curves and Modular Forms , 1984 .
[25] N. Tzanakis,et al. Solving elliptic diophantine equations by estimating linear forms in elliptic logarithms , 1994 .
[26] Chin-Chen Chang,et al. New Public-Key Cipher System Based Upon the Diophantine Equations , 1995, IEEE Trans. Computers.