Výsledky vyhľadávania - time and space complexity of algorithms

Mutual upper bounds of size and time for a Turing machine and a Markov–Post algorithm for mutual simulations Autor Kosovskii, N. K., Kosovskaya, T. M., Kosovskii, N. N.

“…A Markov–Post algorithm and a Turing machine, which have mutual upper bounds on time and space, are proven to be interchangeable up to a linear function of space and a polynomial of time for the Turing machine, respectively…”
Získať plný text

Time–space complexity of quantum search algorithms in symmetric cryptanalysis: applying to AES and SHA-2 Autor Kim, Panjin, Han, Daewan, Jeong, Kyung Chul

“…Performance of cryptanalytic quantum search algorithms is mainly inferred from query complexity which hides overhead induced by an implementation…”
Získať plný text

A Low Complexity Space-Time Algorithm for Green ITS-Roadside Unit Planning Autor Lucic, Michael C., Ghazzai, Hakim, Massoud, Yehia

“… For large-scale problems, heuristic approaches that achieve a trade-off between execution time and planning performance, can be good enough for making planning decisions…”
Získať plný text

Real-time low-complexity diversity combining algorithm for free space coherent optical communication systems over atmospheric turbulence channel Autor Xu, Kejia, Song, Jingwei, Li, Yan, Chen, Junjie, Qiu, Jifang, Hong, Xiaobin, Guo, Hongxiang, Yang, Zhisheng, Wu, Jian

“…) algorithm, is evaluated, and a real-time experimental validation is presented. This proposed scheme employs the CV-DD-LMS algorithm to concurrently perform beam combination and carrier phase recovery (CPR…”
Získať plný text

Antenna Selection in Space-Time Block Coded Systems: Performance Analysis and Low-Complexity Algorithm Autor Chiang-Yu Chen, Sezgin, A., Cioffi, J.M., Paulraj, A.

“…This paper presents outage probability analysis and a practical algorithm for antenna selection in multiple-input multiple-output wireless communication systems employing space-time block codes (STBC…”
Získať plný text

A Comparative Analysis of Computational Complexity in Genetic Algorithm Variants: Evaluating Time and Space Trade-offs Autor Dr. Madhur Jain, Dr. Shilpi Jain, Avinash Kumar

“…]. It will study computational complexity in terms of time (with respect to speed of convergence…”
Získať plný text

A Note on Time and Space Complexity of RSA and ElGamal Cryptographic Algorithms Autor Emmanuel, Adeniyi Abidemi, E, Okeyinka Aderemi, O, Adebiyi Marion, O, Asani Emmanuel

“…The computational complexity study of algorithms is highly germane to the design and development of high-speed computing devices…”
Získať plný text

Analyzing Time and Space Complexity: Kadane vs. Divide and Conquer Algorithms for Maximum Sub-array Problem Autor ISTIONO, Wirawan

Získať plný text

Reducing Search Space of K-Shortest Path Algorithm to Reduce Time Complexity in EON Autor Upadhyay, Paresh, Patel, Akhilesh, Singh, Yatindra Nath

“… K-shortest path with a large 'K' can find a path most of the time but lead to an increase in time complexity…”
Získať plný text

FORAlign: accelerating gap-affine DNA pairwise sequence alignment using FOR-blocks based on Four Russians approach with linear space complexity Autor Wei, Yanming, Zhou, Tong, Zhai, Yixiao, Yu, Liang, Zou, Quan

“… This paper introduces the FORAlign algorithm, leveraging the Four Russians algorithm with identical upper-bound time and space complexity as the Hirschberg divide-and-conquer PSA algorithm, aimed…”
Získať plný text

A space improved algorithm for chromatic number Autor Wu, Pu, Gu, Huanyu, Jiang, Huiqin, Shao, Zehui, Xu, Jin

“… The questions of whether an algorithm for the chromatic number problem with time complexity O…”
Získať plný text

Implimentation Of Table_Track_Sort() Algorithm Which Classifies the Elements of an Array in Known Order. Further Examining the Time Complexity and Space Complexity of an Algorithm and Analysing the Efficacy of the Algorithm - A Case Study Autor AKILESHWER, P, SANJAY, M R

“… Further, the amount of memory it uses for processing also matters in calculating the space complexity of the program…”
Získať plný text

Low-Complexity Decoding Algorithms for Distributed Space-Time Coded Regenerative Relay Systems Autor Zhang, Chao, Yin, Huarui

“…We examine decoding structure for distributed space-time coded regenerative relay networks…”
Získať plný text

Space-Time Low Complexity Algorithms for Scheduling a Fleet of UAVs in Smart Cities Using Dimensionality Reduction Approaches Autor Bahabry, Ahmed, Ghazzai, Hakim, Vesonder, Gregg, Massoud, Yehia

“…In this paper, we propose three low complexity algorithms to solve a scheduling framework problem for Unmanned Aerial Vehicles (UAVs) in smart cities…”
Získať plný text

Low-complexity sphere decoding algorithm for quasi-orthogonal space-time block codes Autor Peng, A.Y.-C., Il-Min Kim, Yousefi, S.

“…Space-time codes can be decoded by the sphere decoding (SD) algorithm to reduce the complexity and retain maximum-likelihood (ML) performance…”
Získať plný text

A low complexity STPAP algorithm based on an alternating polarization-sensitive array Autor Sha, Shuang, Lyu, Tingting, Zhang, Hao, Gulliver, T. Aaron, Dong, Ying

“…Background Space–time adaptive processing (STAP) has been widely used in the fields of communication, radar, and navigation anti-jamming…”
Získať plný text

Analyzing cryptographic algorithm efficiency with in graph-based encryption models Autor Banu, Yashmin, Rath, Biplab Kumar, Gountia, Debasis

“… In this study, we analyze the performance of RSA and ElGamal cryptographic algorithms by evaluating time and space complexity across various file types, including text, image, audio, and data of different sizes…”
Získať plný text

Nearly Time-Optimal Kernelization Algorithms for the Line-Cover Problem with Big Data Autor Chen, Jianer, Huang, Qin, Kanj, Iyad, Xia, Ge

“… ) , where k is the size of the sought line cover. Motivated by the current research in massive data processing, we study the existence of kernelization algorithms with limited space and time complexity for Line- Cover…”
Získať plný text

Reduced complexity M algorithm design for multiple symbol differential unitary space-time systems Autor Jin, Xiao-Ping, Ying, Ying-Guo, Jin, Ning

“…(MSDD), a series of low complexity and sub-superior detect algorithms have been proposed so far, in which the M algorithm is well appreciated for its fixed complexity and latency…”
Získať plný text

A faster FPTAS for knapsack problem with cardinality constraint Autor Li, Wenxin, Lee, Joohyun, Shroff, Ness

“… It is well known that, there is no fully polynomial time approximation scheme (FPTAS) for the d-dimensional knapsack problem when d≥2, unless P = NP…”
Získať plný text