Computational Time Complexity for k-Sum Problem Amalgamated with Quantum Search-Reference-Cited by-同舟云学术

登录注册会员服务联系我们

Computational Time Complexity for k-Sum Problem Amalgamated with Quantum Search

Published:2023-04-21 Issue: Volume: Page:
ISSN:
Container-title:2023 International Conference on Artificial Intelligence and Applications (ICAIA) Alliance Technology Conference (ATCON-1)
language:
Short-container-title:

Author:

Dutta Anurag¹,Harshith John²,Lakshmanan K.³,Ramamoorthy A.⁴

Affiliation:

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

2. Vellore Institute of Technology,Department of Computer Science & Engineering,Vellore,India

3. Kuwait American School of Education,Department of Mathematics,Salmiya,Kuwait

4. Velammal Engineering College,Department of Mathematics,Chennai,India

Publisher

IEEE

Link

http://xplorestaging.ieee.org/ielx7/10169127/10169124/10169278.pdf?arnumber=10169278

Reference25 articles.

1. Extrapolating linked list data structures to 3rd dimension

2. Contrasting Parallelized with Sequential Sorting

3. A Unified Vista and Juxtaposed Study on Sorting Algorithms

4. Computational Time Complexity for Sorting Algorithm amalgamated with Quantum Search

5. Validation of Minimal Worst-Case Time Complexity by Stirling’s, Ramanujan’s, and Mortici’s Approximation

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

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

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线，采集、加工和组织学术论文而形成的新型学术文献查询和分析系统，可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容，当前同舟云学术共收录了国内外主流学术期刊6万余种，收集的期刊论文及会议论文总量共计约1.5亿篇，并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询！咨询电话：010-8811{复制后删除}0370

www.globalauthorid.com

TOP