Researchers and authors can directly submit their manuscript online through this link Online Manuscript Submission.
A Computational Algorithm For The Hardy Function Z(t), Utilizing Sub-Se-quences of Generalized Cubic Gauss Sums, With An Overall Operational Complexity O((t⁄εt)[0.25, 0.3]{log(t)}2+o(1)) FOR ∈[1023−35]
Citation
D. M. Lewis* and A. R. Brereton
Lewis, D. M., Brereton, A. R. (2026). A Computational Algorithm For The Hardy Function Z(t), Utilizing Sub-Sequences of Generalized Cubic Gauss Sums, With An Overall Operational Complexity O((tÃÂâÃÂÃÂÃÂÃÂÃÂÃÂÃÂõt) [0.25, 0.3]{log(t)}2+o(1)) FOR ÃÂâÃÂÃÂÃÂà[1023ÃÂâÃÂÃÂÃÂÃÂ35]. J Math Techniques Comput Math, 5(4), 1-45

