Zobrazeno 1 - 10
of 1 138
pro vyhledávání: '"Kumar Rajendra"'
Autor:
Gowrishankar M. C., Sathyashankara Sharma, B. K. Pavan, Kamath Kiran, Kumar Rajendra, Pavan Hiremath, Manjunath Shettar
Publikováno v:
Journal of Mechanical Engineering and Sciences, Vol 13, Iss 1, Pp 4380-4389 (2019)
Aluminium alloy matrix composites with Al2O3 reinforcements exhibit superior mechanical properties and utilize in several demanding fields’ viz., automobile, aerospace, defense, sports equipment, electronics and bio-medical. The present work emphas
Externí odkaz:
https://doaj.org/article/3a867efe5be54a6a8f6bc3bf62084d9e
Using comprehensive x-ray reciprocal space mapping, we establish the precise lattice-matching composition for wurtzite $Sc_xAl_{1-x}N$ layers on (0001) GaN to be x = 0.14+/-0.01. 100-nm thick $Sc_xAl_{1-x}N$ films (x = 0.09 - 0.19) were grown in smal
Externí odkaz:
http://arxiv.org/abs/2406.01540
While seemingly undesirable, it is not a surprising fact that there are certain problems for which quantum computers offer no computational advantage over their respective classical counterparts. Moreover, there are problems for which there is no `us
Externí odkaz:
http://arxiv.org/abs/2309.16431
Autor:
Arya, Tushar1 (AUTHOR), Kumar, Rajendra2 (AUTHOR), Aziz, Tarique3 (AUTHOR), Alam, Md Shadab4 (AUTHOR), Kujur, Anit5 (AUTHOR) kujuranit@yahoo.com
Publikováno v:
Journal of Family Medicine & Primary Care. Nov2024, Vol. 13 Issue 11, p5033-5039. 7p.
Autor:
Aggarwal, Divesh, Bennett, Huck, Brakerski, Zvika, Golovnev, Alexander, Kumar, Rajendra, Li, Zeyong, Peters, Spencer, Stephens-Davidowitz, Noah, Vaikuntanathan, Vinod
We study the complexity of lattice problems in a world where algorithms, reductions, and protocols can run in superpolynomial time, revisiting four foundational results: two worst-case to average-case reductions and two protocols. We also show a nove
Externí odkaz:
http://arxiv.org/abs/2211.11693
Autor:
Aggarwal, Divesh, Kumar, Rajendra
Recent work [BGS17,ABGS19] has shown SETH hardness of some constant factor approximate CVP in the $\ell_p$ norm for any $p$ that is not an even integer. This result was shown by giving a Karp reduction from $k$-SAT on $n$ variables to approximate CVP
Externí odkaz:
http://arxiv.org/abs/2211.04385