Suchergebnisse - average-case algorithm complexity

Average-case complexity of the Euclidean algorithm with a fixed polynomial over a finite field von 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 …”
Volltext

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

Volltext

Minimum average case time complexity for sorting algorithms von 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 …”
Volltext

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

Volltext

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

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

New and improved search algorithms and precise analysis of their average-case complexity von 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 …”
Volltext

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

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

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

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

On the average-case complexity of pattern matching with wildcards von 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 …”
Volltext

Generalized Leapfrogging Samplesort: A Class of \(O(n \log^2 n)\) Worst-Case Complexity and \(O(n \log n)\) Average-Case Complexity Sorting Algorithms von 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 …”
Volltext

Quantum Algorithm for Lexicographically Minimal String Rotation von 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 …”
Volltext

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

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

Average-case complexity of the Whitehead problem for free groups von 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 …”
Volltext

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

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

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

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

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

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

Average complexity of backward q-gram string matching algorithms von 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 …”
Volltext

Average-case complexity of the Euclidean algorithm with a fixed polynomial over a finite field von 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 …”
Volltext

A satisfiability algorithm and average-case hardness for formulas over the full binary basis von Seto, Kazuhisa, Tamaki, Suguru

“… average-case hardness of affine extractors for linear-sized formulas over the full binary basis …”
Volltext

Average-case complexity of single-source shortest-paths algorithms: lower and upper bounds von 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 …”
Volltext