Výsledky vyhľadávania - average-case algorithm complexity

Average-case complexity of the Euclidean algorithm with a fixed polynomial over a finite field Autor 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…”
Získať plný text

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

Získať plný text

Minimum average case time complexity for sorting algorithms Autor 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…”
Získať plný text

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

Získať plný text

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

“… known. Such a point can be found by an algorithmic approach – a so-called phase 1 algorithm or centering algorithm…”
Získať plný text

New and improved search algorithms and precise analysis of their average-case complexity Autor 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…”
Získať plný text

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

“… It is shown how the complexity of the arithmetic coder algorithm depends on the complexity measures…”
Získať plný text

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

“…We prove an exponential lower bound on the average time of inverting Goldreich’s function by drunken backtracking algorithms…”
Získať plný text

On the average-case complexity of pattern matching with wildcards Autor 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…”
Získať plný 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 Autor 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…”
Získať plný text

Quantum Algorithm for Lexicographically Minimal String Rotation Autor 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…”
Získať plný text

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

“…We exactly characterize the average-case complexity of the polynomial-time hierarchy (PH) by the worst-case (meta…”
Získať plný text

Average-case complexity of the Whitehead problem for free groups Autor 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…”
Získať plný text

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

“…We prove a lower bound expressed in the increment sequence on the average‐case complexity of the number of inversions of Shellsort…”
Získať plný text

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

“… For the QuickSort algorithm, known average-case complexity results are of Θ…”
Získať plný text

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

“…In this paper, we initiate the study of average-case complexity and circuit analysis algorithms for comparator circuits…”
Získať plný text

Average complexity of backward q-gram string matching algorithms Autor 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…”
Získať plný text

Average-case complexity of the Euclidean algorithm with a fixed polynomial over a finite field Autor 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…”
Získať plný text

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

“… average-case hardness of affine extractors for linear-sized formulas over the full binary basis…”
Získať plný text

Average-case complexity of single-source shortest-paths algorithms: lower and upper bounds Autor 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…”
Získať plný text