Computational Time Complexity for Sorting Algorithm amalgamated with Quantum Search-Reference-Cited by-同舟云学术

Computational Time Complexity for Sorting Algorithm amalgamated with Quantum Search

Published:2023-01-24 Issue: Volume: Page:
ISSN:
Container-title:2023 International Conference for Advancement in Technology (ICONAT)
language:
Short-container-title:

Author:

Dutta Anurag¹,Harshith John²,Soni Yash³,Gupta Avdhesh⁴,Gupta Vishan Kumar⁵,Gupta Ankit⁵

Affiliation:

1. Government College of Engineering & Textile Technology,Department of Computer Science and Engineering,Serampore,Calcutta,India

2. Vellore Institute of Technology University, Vellore Campus,Department of Computer Science and Engineering,Vellore,Tamil Nadu,India

3. Shri Govindram Seksaria Institute of Technology & Science,Department of Information Technology,Indore,India

4. Ajay Kumar Garg Engineering College,Department of Information Technology,Ghaziabad,Uttar Pradesh,India

5. Graphic Era Deemed to be University,Department of Computer Science and Engineering,Dehradun,Uttarakhand,India

Publisher

IEEE

Link

Reference25 articles.

1. Logarithmic Integral;weisstein,0

Cited by 11 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

2. Detecting Fraud Calls vis-à-vis Natural Language Processing;2024 2nd International Conference on Advancement in Computation & Computer Technologies (InCACCT);2024-05-02

3. Plexus Search – A Search Enumeration;2023 IEEE Silchar Subsection Conference (SILCON);2023-11-03