Ajay Nerurkar

Publication Activity (10 Years)

Years Active: 1997-2000
Publications (10 Years): 0

Publications

Jin-yi Cai, Ajay Nerurkar
A note on the non-NP-hardness of approximate lattice problems under general Cook reductions. Inf. Process. Lett. 76 (1-2) (2000)
Jin-yi Cai, Ajay Nerurkar
) Is NP-Hard under Randomized Reductions. J. Comput. Syst. Sci. 59 (2) (1999)
Jin-yi Cai, George Havas, Bernard Mans, Ajay Nerurkar, Jean-Pierre Seifert, Igor E. Shparlinski
On Routing in Circulant Graphs. COCOON (1999)
Jin-yi Cai, Ajay Nerurkar, D. Sivakumar
Hardness and Hierarchy Theorems for Probabilistic Quasi-Polynomial Time. STOC (1999)
Jin-yi Cai, Ajay Nerurkar
Approximating the SVP to within a Factor is NP-Hard under Randomized Reductions. Computational Complexity Conference (1998)
Jin-yi Cai, Ajay Nerurkar
An Improved Worst-Case to Average-Case Connection for Lattice Problems. FOCS (1997)
Jin-yi Cai, Ajay Nerurkar
) is NP-hard under randomized reductions Electron. Colloquium Comput. Complex. 4 (59) (1997)