Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
Hilfe
Suche: Author="Nerurkar, Ajay"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
A note on the non-
NP
-hardness of approximate lattice problems under general Cook reductions
Jin-Yi Cai
,
Ajay Nerurkar
Information Processing Letters
76
(1-2), 2000, pp. 61-66
On routing in circulant graphs
Jin-Yi Cai
,
George Havas
,
Bernard Mans
,
Ajay Nerurkar
,
Jean-Pierre Seifert
,
Igor Shparlinski
Lecture Notes in Computer Science
1627
, 1999, pp. 360-369
Hardness and hierarchy theorems for probabilistic quasi-polynomial time
Jin-Yi Cai
,
Ajay Nerurkar
,
D. Sivakumar
Proceedings of the 31st Annual ACM Symposium on Theory of Computing, STOC'99 (Atlanta, Georgia, May 1-4, 1999)
, 1999, pp. 726-735
Approximating the SVP to within a factor
(1+1/dim^\varepsilon
is
NP
-hard under randomized reductions
Jin-Yi Cai
,
Ajay Nerurkar
Journal of Computer and System Sciences
59
(2), 1999, pp. 221-239
Approximating the SVP to within a factor
(1+\frac{1}{\mbox{dim}^\epsilon})
is
NP
-hard under randomized reductions
Jin-Yi Cai
,
Ajay Nerurkar
Proceedings of the 13th Annual IEEE Conference on Computational Complexity (Buffalo, New York, June 15-18, 1998)
, 1998, pp. 46-55
An improved worst-case to average-case connection for lattice problems
Jin-Yi Cai
,
Ajay P. Nerurkar
Proceedings of the 38th Annual IEEE Symposium on Foundations of Computer Science, FOCS'97 (Miami Beach, Florida, October 20-22, 1997)
, 1997, pp. 468-477