• # na24

• Referenced in 12 articles [sw11485]
• Envelope (PE) algorithms are performed. Worst-case time complexity, convergence results, and examples are included ... reduce the brute force quadratic worst-case time complexity to linear time by using either...
• # BEDFix

• Referenced in 8 articles [sw04469]
• method averaged 31 percent of this worst-case bound. BEDFix works for nonsmooth continuous functions ... Lipschitz constants equal to 1, whereas the complexity of simple iteration approaches infinity ... compute absolute criterion solutions, the worst-case complexity depends on the logarithm of the reciprocal...
• # TRecS

• Referenced in 2 articles [sw14145]
• Luke Ong in 2006, but its worst-case complexity is k-EXPTIME complete for order ... many typical inputs, despite the huge worst-case complexity. Since the development of TRecS...
• # Algorithm 848

• Referenced in 2 articles [sw04408]
• defined on all rectangular domains, the worst-case complexity of PFix has order equal ... order of the worst-case bound for the case of the unit hypercube. PFix ... found in the authors’ paper [J. Complexity...
• # TiML

• Referenced in 1 article [sw27564]
• lower annotation burden, and, furthermore, big-O complexity can be inferred from recurrences generated during ... usability by implementing a broad suite of case-study modules, demonstrating that TiML, though lacking ... versatile enough to verify worst-case and/or amortized complexities for algorithms and data structures like...
• outperforms all previous approaches on real-world complex networks. The efficiency of the new algorithm ... with respect to the $Theta(|E|)$ worst-case performance. We experimentally show that this ... technique achieves similar speedups on real-world complex networks, as well. par The second contribution...