Stop the war!
Остановите войну!
for scientists:
default search action
BibTeX records: Ajay Nerurkar
@article{DBLP:journals/ipl/CaiN00, author = {Jin{-}yi Cai and Ajay Nerurkar}, title = {A note on the non-NP-hardness of approximate lattice problems under general Cook reductions}, journal = {Inf. Process. Lett.}, volume = {76}, number = {1-2}, pages = {61--66}, year = {2000}, url = {https://doi.org/10.1016/S0020-0190(00)00123-X}, doi = {10.1016/S0020-0190(00)00123-X}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ipl/CaiN00.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jcss/CaiN99, author = {Jin{-}yi Cai and Ajay Nerurkar}, title = {Approximating the {SVP} to within a Factor (1+1/dim\({}^{\mbox{xi}}\)) Is NP-Hard under Randomized Reductions}, journal = {J. Comput. Syst. Sci.}, volume = {59}, number = {2}, pages = {221--239}, year = {1999}, url = {https://doi.org/10.1006/jcss.1999.1649}, doi = {10.1006/JCSS.1999.1649}, timestamp = {Tue, 16 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/jcss/CaiN99.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/cocoon/CaiHMNSS99, author = {Jin{-}yi Cai and George Havas and Bernard Mans and Ajay Nerurkar and Jean{-}Pierre Seifert and Igor E. Shparlinski}, editor = {Takao Asano and Hiroshi Imai and D. T. Lee and Shin{-}Ichi Nakano and Takeshi Tokuyama}, title = {On Routing in Circulant Graphs}, booktitle = {Computing and Combinatorics, 5th Annual International Conference, {COCOON} '99, Tokyo, Japan, July 26-28, 1999, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {1627}, pages = {360--369}, publisher = {Springer}, year = {1999}, url = {https://doi.org/10.1007/3-540-48686-0\_36}, doi = {10.1007/3-540-48686-0\_36}, timestamp = {Sat, 30 Sep 2023 09:37:25 +0200}, biburl = {https://dblp.org/rec/conf/cocoon/CaiHMNSS99.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/CaiNS99, author = {Jin{-}yi Cai and Ajay Nerurkar and D. Sivakumar}, editor = {Jeffrey Scott Vitter and Lawrence L. Larmore and Frank Thomson Leighton}, title = {Hardness and Hierarchy Theorems for Probabilistic Quasi-Polynomial Time}, booktitle = {Proceedings of the Thirty-First Annual {ACM} Symposium on Theory of Computing, May 1-4, 1999, Atlanta, Georgia, {USA}}, pages = {726--735}, publisher = {{ACM}}, year = {1999}, url = {https://doi.org/10.1145/301250.301444}, doi = {10.1145/301250.301444}, timestamp = {Tue, 06 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/stoc/CaiNS99.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/coco/CaiN98, author = {Jin{-}yi Cai and Ajay Nerurkar}, title = {Approximating the {SVP} to within a Factor is NP-Hard under Randomized Reductions}, booktitle = {Proceedings of the 13th Annual {IEEE} Conference on Computational Complexity, Buffalo, New York, USA, June 15-18, 1998}, pages = {46}, publisher = {{IEEE} Computer Society}, year = {1998}, url = {https://doi.org/10.1109/CCC.1998.694590}, doi = {10.1109/CCC.1998.694590}, timestamp = {Fri, 24 Mar 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/coco/CaiN98.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/focs/CaiN97, author = {Jin{-}yi Cai and Ajay Nerurkar}, title = {An Improved Worst-Case to Average-Case Connection for Lattice Problems}, booktitle = {38th Annual Symposium on Foundations of Computer Science, {FOCS} '97, Miami Beach, Florida, USA, October 19-22, 1997}, pages = {468--477}, publisher = {{IEEE} Computer Society}, year = {1997}, url = {https://doi.org/10.1109/SFCS.1997.646135}, doi = {10.1109/SFCS.1997.646135}, timestamp = {Thu, 23 Mar 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/focs/CaiN97.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/ECCC-TR97-059, author = {Jin{-}yi Cai and Ajay Nerurkar}, title = {Approximating the {SVP} to within a factor {(1} + 1/dim\({}^{\mbox{epsilon}}\)) is NP-hard under randomized reductions}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR97-059}}, year = {1997}, url = {https://eccc.weizmann.ac.il/eccc-reports/1997/TR97-059/index.html}, eprinttype = {ECCC}, eprint = {TR97-059}, timestamp = {Wed, 28 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR97-059.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.