 | 2000 |
|---|
| 7 |       | 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): 61-66 (2000) |
| 1999 |
|---|
| 6 | | Jin-yi Cai,
George Havas,
Bernard Mans,
Ajay Nerurkar,
Jean-Pierre Seifert,
Igor Shparlinski:
On Routing in Circulant Graphs.
COCOON 1999: 360-369 |
| 5 | | Jin-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 |
|---|
| 3 | | Jin-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 |
|---|
| 2 | | Jin-yi Cai,
Ajay Nerurkar:
An Improved Worst-Case to Average-Case Connection for Lattice Problems.
FOCS 1997: 468-477 |
| 1 | | Jin-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) |
