Ajay Nerurkar

Available identifiers

zbMath Open nerurkar.ajayMaRDI QIDQ1589480

List of research outcomes

Publication	Date of Publication	Type
Hardness and hierarchy theorems for probabilistic quasi-polynomial time	2016-09-29	Paper
A note on the non-NP-hardness of approximate lattice problems under general Cook reductions.	2000-12-12	Paper
Approximating the SVP to within a factor \((1+1/\dim^\varepsilon)\) is NP-hard under randomized reductions	2000-01-17	Paper
https://portal.mardi4nfdi.de/entity/Q4258570	1999-09-13	Paper

Research outcomes over time

This page was built for person: Ajay Nerurkar