Ajay Nerurkar
From MaRDI portal
List of research outcomes
This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!
| Publication | Date of Publication | Type |
|---|---|---|
| Hardness and hierarchy theorems for probabilistic quasi-polynomial time Proceedings of the thirty-first annual ACM symposium on Theory of Computing | 2016-09-29 | Paper |
| A note on the non-NP-hardness of approximate lattice problems under general Cook reductions. Information Processing Letters | 2000-12-12 | Paper |
| Approximating the SVP to within a factor \((1+1/\dim^\varepsilon)\) is NP-hard under randomized reductions Journal of Computer and System Sciences | 2000-01-17 | Paper |
| scientific article; zbMATH DE number 1335879 (Why is no real title available?) | 1999-09-13 | Paper |
Research outcomes over time
This page was built for person: Ajay Nerurkar
