4 papers
On the Minimality of the Conductor for Elliptic Curve -Functions
K. Lakshmanan
We investigate the role of the conductor in analytic rank bounds for elliptic curves over \(\mathbb{Q}\). Let \(E/\mathbb{Q}\) be an elliptic curve with conductor \(N_E\). We consi…
Computational Complexity of Finding Subgroups of a Given Order
K. Lakshmanan
We study the problem of finding a subgroup of a given order in a finite group, where the group is represented by its Cayley table. We analyze the complexity of the problem in the s…
Primes and Bivariate Polynomials without Constant Terms: A Recursive Algorithm
K. Lakshmanan
We investigate the computational problem of determining whether a bivariate polynomial with non-negative coefficients and no constant term can attain a prime value. While classical…
Uncomputability of Global Optima for Nonconvex Functions in the Oracle Model
K Lakshmanan
While it is well known that finding approximate optima of non-convex functions is computationally intractable, we show that the problem is, in fact, uncomputable in the oracle mode…