dblp.uni-trier.dewww.uni-trier.de

Ajay Nerurkar

List of publications from the DBLP Bibliography Server - FAQ
Coauthor Index - Ask others: ACM DL/Guide - CiteSeer - CSB - Google - MSN - Yahoo

2000
7EEJin-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): 61-66 (2000)
1999
6EEJin-yi Cai, George Havas, Bernard Mans, Ajay Nerurkar, Jean-Pierre Seifert, Igor Shparlinski: On Routing in Circulant Graphs. COCOON 1999: 360-369
5EEJin-yi Cai, Ajay Nerurkar, D. Sivakumar: Hardness and Hierarchy Theorems for Probabilistic Quasi-Polynomial Time. STOC 1999: 726-735
4 Jin-yi Cai, Ajay Nerurkar: Approximating the SVP to within a Factor (1+1/dimxi) Is NP-Hard under Randomized Reductions. J. Comput. Syst. Sci. 59(2): 221-239 (1999)
1998
3EEJin-yi Cai, Ajay Nerurkar: Approximating the SVP to within a Factor is NP-Hard under Randomized Reductions. IEEE Conference on Computational Complexity 1998: 46-
1997
2EEJin-yi Cai, Ajay Nerurkar: An Improved Worst-Case to Average-Case Connection for Lattice Problems. FOCS 1997: 468-477
1EEJin-yi Cai, Ajay Nerurkar: Approximating the SVP to within a factor (1 + 1/dimepsilon) is NP-hard under randomized reductions Electronic Colloquium on Computational Complexity (ECCC) 4(59): (1997)

Coauthor Index

1Jin-yi Cai [1] [2] [3] [4] [5] [6] [7]
2George Havas [6]
3Bernard Mans [6]
4Jean-Pierre Seifert [6]
5Igor Shparlinski [6]
6D. Sivakumar [5]

Copyright © Sun May 17 03:24:02 2009 by Michael Ley (ley@uni-trier.de)