Search Results - asymptotic complexity of the algorithm

Combinatorial assignment algorithm goals by A.V. Danilov, P.P. Makarychev

“…). The main advantage of combinatorial algorithms for local search for optimal target assignment is low asymptotic complexity…”
Get full text

On fixed point theory in topological posets, extended quasi-metric spaces and an application to asymptotic complexity of algorithms by Shahzad, Naseer, Valero, Oscar, Alghamdi, Mohammed A, Alghamdi, Maryam A

“… Finally, the applicability of the exposed results is illustrated providing a methodology to determine the asymptotic upper bound of the complexity of those algorithms whose running time of computing…”
Get full text

On fixed point theory in partially ordered sets and an application to asymptotic complexity of algorithms by Estevan, Asier, Miñana, Juan-José, Valero, Oscar

“…The celebrated Kleene fixed point theorem is crucial in the mathematical modelling of recursive specifications in Denotational Semantics. In this paper we…”
Get full text

A short note on post-hoc testing using random forests algorithm: Principles, asymptotic time complexity analysis, and beyond by Stepanek, Lubomir, Habarta, Filip, Mala, Ivana, Marek, Lubos

“… In this work, we address the issue using a random forest-based algorithm, practically assumption-free, classifying individual observations into the factor's categories using the dependent continuous…”
Get full text

Solving Hard Computational Problems Efficiently: Asymptotic Parametric Complexity 3-Coloring Algorithm by Martín H., José Antonio

“…Many practical problems in almost all scientific and technological disciplines have been classified as computationally hard (NP-hard or even NP-complete). In…”
Get full text

Asymptotic and Exact Results on the Complexity of the Novelli-Pak-Stoyanovskii Algorithm by Schneider, Carsten, Sulzgruber, Robin

“… We obtain new asymptotic results on the average case and worst case complexity of this algorithm as the underlying shape tends to a fixed limit curve…”
Get full text

New results on the mathematical foundations of asymptotic complexity analysis of algorithms via complexity spaces by Romaguera, S., Tirado, P., Valero, O.

“…] introduced the theory of complexity (quasi-metric) spaces as a part of the development of a topological foundation for the asymptotic complexity analysis of programs and algorithms in 1995…”
Get full text

On Clarifying the Asymptotic Behavior of the Complexity Function of the Bubble Sort Algorithm by Kostikov, Yu. A., Romanenkov, A. M.

“… The approach is demonstrated on the example of calculating the second and third terms of the asymptotic expansion of the cost function of the bubble sort algorithm…”
Get full text

A new contribution to the fixed point theory in partial quasi-metric spaces and its applications to asymptotic complexity analysis of algorithms by Mohammadi, Zahra, Valero, Oscar

“…In this paper we continue the study of fixed point theory in partial quasi-metric spaces and its usefulness in complexity analysis of algorithms…”
Get full text

On fixed point theory in partially ordered sets and an application to asymptotic complexity of algorithms by Estevan, Asier, Juan-José Minãna, Valero, Oscar

“…The celebrated Kleene fixed point theorem is crucial in the mathematical modelling of recursive specifications in Denotational Semantics. In this paper we…”
Get full text

On the asymptotic complexity of solving LWE by Herold, Gottfried, Kirshanova, Elena, May, Alexander

“…–Peikert and several pruning strategies appear as special cases. We show that within this framework, all lattice algorithms achieve the same asymptotic complexity…”
Get full text

A Multi-Scale Centralized Asymptotic Optimization Algorithm for Low-Complexity Acoustic Scene Classification by Pang, Xin, Ge, Fengpei, Li, Yanling

“…Acoustic scene classification under lowcomplexity conditions presents unique challenges due to limited data availability and computational constraints. To…”
Get full text

Generalizing the Brady-Yong Algorithm: Efficient Fast Hough Transform for Arbitrary Image Sizes by Kazimirov, Danil D., Rybakova, Ekaterina O., Gulevskii, Vitalii V., Terekhin, Arseniy P., Limonova, Elena E., Nikolaev, Dmitry P.

“… The algorithm that generalizes the Brady-Yong algorithm for non-power-of-two image width with the same asymptotic complexity is known, but it has not been studied neither in terms of the constant…”
Get full text

An Effective Approach to Analyze Algorithms with Linear O(n) Worst-Case Asymptotic Complexity by Yousaf, Qazi Haseeb, Arif, Muhammad, Naseem, Rashid, Wakil, Karzan, Ullah, Ghufran

“… The worst-case asymptotic complexity classifies an algorithm to a certain class. The asymptotic complexity for algorithms returns the degree variable of the algorithmic function while ignores the lower terms…”
Get full text

Synthetic aperture focusing of ultrasonic data from multilayered media using an omega-K algorithm by Skjelvareid, M H, Olofsson, T, Birkelund, Y, Larsen, Y

“…), which combines PSM and the ω-k algorithm to perform multilayer imaging more efficiently. The asymptotic complexity is shown to be lower for MULOK than for PSM, and this is confirmed by comparing execution times for implementations of both algorithms…”
Get full text

Defining Asymptotic Parallel Time Complexity of Data-dependent Algorithms by Fritzsche, Paula, Rexachs, Dolores, Luque, Emilio

“… As a consequence, the end-users of these systems have a vested interest in defining the asymptotic time complexity of parallel algorithms to predict their performance on a particular parallel computer…”
Get full text

The bilinear complexity and practical algorithms for matrix multiplication by Smirnov, A. V.

“… × n matrices is proposed. The asymptotic arithmetic complexity of this algorithm is O ( n 2.7743 )…”
Get full text

Stabilization of Rössler chaotic dynamical system using fuzzy logic control algorithm by Precup, Radu-Emil, Tomescu, Marius-Lucian, Dragos, Claudia-Adina

“… The new FLCA is formulated to offer sufficient inequality stability conditions. The asymptotic complexity of our algorithm is analyzed and proved to be lower in comparison with that of linear matrix inequality-based FLCAs…”
Get full text

Nearly Linear Time Algorithms for Preconditioning and Solving Symmetric, Diagonally Dominant Linear Systems by Spielman, Daniel A., Teng, Shang-Hua

“…We present a randomized algorithm that on input a symmetric, weakly diagonally dominant $n$-by-$n$ matrix $A$ with $m…”
Get full text

The Baire Partial Quasi-Metric Space: A Mathematical Tool for Asymptotic Complexity Analysis in Computer Science by Cerdà-Uguet, M. A., Schellekens, M. P., Valero, O.

“… Schellekens introduced the theory of complexity (quasi-metric) spaces as a part of the development of a topological foundation for the asymptotic complexity analysis of programs and algorithms (Electron. Notes Theor. Comput. Sci. 1:211–232, 1995…”
Get full text