BIBLIOMETRIC ANALYSIS OF COMPUTATIONAL COMPLEXITY
محل انتشار: سیزدهمین کنفرانس نظریه گراف و ترکیبیات جبری
سال انتشار: 1404
نوع سند: مقاله کنفرانسی
زبان: انگلیسی
مشاهده: 92
نسخه کامل این مقاله ارائه نشده است و در دسترس نمی باشد
- صدور گواهی نمایه سازی
- من نویسنده این مقاله هستم
استخراج به نرم افزارهای پژوهشی:
شناسه ملی سند علمی:
GTACCA01_051
تاریخ نمایه سازی: 19 مرداد 1404
چکیده مقاله:
In this study, we present a comprehensive bibliometric analysis of computational complexity by examining ۵۴,۶۷۵ records obtained from Crossref and other databases. Following the removal of ۴,۱۹۸ duplicates and ۶۸ incomplete records, a total of ۵۰,۴۰۹ studies were evaluated for eligibility. Systematic review methodologies were employed in accordance with the PRISMA ۲۰۲۰ guidelines to analyze key trends within the field. Our findings underscore the continued significance of foundational work on NP-completeness and algorithmic efficiency. Notably, there has been a substantial increase in research focused on time and space complexity in recent years, reflecting a growing interest in optimizing computational processes. This bibliometric analysis provides valuable insights into the evolution of computational complexity research, emphasizing its critical role in both theoretical advancements and practical applications.
کلیدواژه ها:
نویسندگان
ZANIAR KARIMI
Social and Biological Network Analysis Laboratory (SBNA), Department of Computer Engineering, University of Kurdistan, Sanandaj, Iran.
SADEGH SULAIMANY
Social and Biological Network Analysis Laboratory (SBNA), Department of Computer Engineering, University of Kurdistan, Sanandaj, Iran.