Search Results - average-case algorithm complexity*

Average-case complexity of the Euclidean algorithm with a fixed polynomial over a finite field by Giménez, Nardo, Matera, Guillermo, Pérez, Mariana, Privitelli, Melina

“…)$ . We also exhibit asymptotically optimal bounds for the average-case complexity of the Euclidean algorithm applied to pairs ( g , f ) as above…”
Get full text

Average-case complexity of a branch-and-bound algorithm for Min Dominating Set by Denat, Tom, Harutyunyan, Ararat, Melissinos, Nikolaos, Paschos, Vangelis Th

Get full text

Minimum average case time complexity for sorting algorithms by Dutta, Anurag, Choudhury, Manan Roy, Sharma, Rakesh K.

“… However, we have also taken into account the average time complexities of the algorithms to disperse throughout the smallest…”
Get full text

Correction to: Minimum average case time complexity for sorting algorithms by Dutta, Anurag, Choudhury, Manan Roy, Sharma, Rakesh K.

Get full text

Average case complexity results for a centering algorithm for linear programming problems under Gaussian distributions by Huhn, Petra, Wehlitz, Verena

“… known. Such a point can be found by an algorithmic approach – a so-called phase 1 algorithm or centering algorithm…”
Get full text

Arithmetic coder optimization for compressing images obtained through remote probing of water bodies by Arzumanyan, R. V.

“… It is shown how the complexity of the arithmetic coder algorithm depends on the complexity measures…”
Get full text

New and improved search algorithms and precise analysis of their average-case complexity by Emrah Amrahov, Şahin, Mohammed, Adnan Saher, Çelebi, Fatih V.

“…) algorithm solves this problem with very efficient complexity, namely with the complexity θ(log2n). The developments of the BS algorithm, such as Ternary Search…”
Get full text

Generalized Leapfrogging Samplesort: A Class of \(O(n \log^2 n)\) Worst-Case Complexity and \(O(n \log n)\) Average-Case Complexity Sorting Algorithms by Albacea, Eliezer A

“… is \(O(n \log^2 n)\) and the average-case complexity is \(O(n \log n)\). Keywords: Samplesort, Quicksort, Leapfrogging Samplesort, sorting, analysis of algorithms…”
Get full text

On the average-case complexity of pattern matching with wildcards by Barton, Carl

“… (characters that match everything) may be present. In this paper we present a number of complexity results and fast average-case algorithms for pattern matching where wildcards are allowed in the pattern, however, the results are easily adapted…”
Get full text

Lower Bound on Average-Case Complexity of Inversion of Goldreich’s Function by Drunken Backtracking Algorithms by Itsykson, Dmitry

“…We prove an exponential lower bound on the average time of inverting Goldreich’s function by drunken backtracking algorithms…”
Get full text

Quantum Algorithm for Lexicographically Minimal String Rotation by Wang, Qisheng, Ying, Mingsheng

“… In this paper, we propose an O ( n 3 / 4 ) quantum query algorithm for LMSR. In particular, the algorithm has average-case query complexity O ( n log n…”
Get full text

Towards a Realistic Analysis of the QuickSelect Algorithm by Clément, Julien, Fill, James Allen, Nguyen Thi, Thu Hien, Vallée, Brigitte

“… For the QuickSort algorithm, known average-case complexity results are of Θ…”
Get full text

On the average‐case complexity of Shellsort by Vitanyi, Paul

“…We prove a lower bound expressed in the increment sequence on the average‐case complexity of the number of inversions of Shellsort…”
Get full text

Characterizing Average-Case Complexity of PH by Worst-Case Meta-Complexity by Hirahara, Shuichi

“…We exactly characterize the average-case complexity of the polynomial-time hierarchy (PH) by the worst-case (meta…”
Get full text

Average complexity of backward q-gram string matching algorithms by Salmela, Leena

“… In this paper we provide a framework for analyzing the average case complexity of these algorithms taking into account the statistical dependencies between overlapping q-grams…”
Get full text

Average-case complexity of the Whitehead problem for free groups by Shpilrain, Vladimir

“… In this paper, we address the average-case complexity (i.e., the expected runtime) of algorithms that solve a well-known problem, the Whitehead problem in a free group…”
Get full text

Average-case complexity of the Euclidean algorithm with a fixed polynomial over a finite field by Giménez, Nardo, Matera, Guillermo, Pérez, Mariana, Privitelli, Melina

“…). The accuracy of our estimates is confirmed by practical experiments. We also exhibit asymptotically optimal bounds for the average-case complexity of the Euclidean…”
Get full text

Algorithms and Lower Bounds for Comparator Circuits from Shrinkage by Cavalar, Bruno P., Lu, Zhenjian

“…In this paper, we initiate the study of average-case complexity and circuit analysis algorithms for comparator circuits…”
Get full text

Average-case complexity of single-source shortest-paths algorithms: lower and upper bounds by Meyer, Ulrich

“… We use our method to prove lower bounds on the average-case complexity of the following algorithms: the “Bellman–Ford algorithm” [R. Bellman, Quart. Appl. Math. 16 (1958) 87–90, L.R. Ford…”
Get full text

Average-case analysis of algorithms using Kolmogorov complexity by Jiang, Tao, Li, Ming, Vitányi, Paul M. B.

“…Analyzing the average-case complexity of algorithms is a very practical but very difficult problem in computer science…”
Get full text