16 citations · 18 across the 6 of their papers we have counts for
Showing 2024Show all
2 papers · 1 filter
math.NT2024
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…
math.OC2024
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…