Worst-Case Complexity Bounds on Algorithms for Computing the Canonical Structure of Finite Abelian Groups and the Hermite and Smith Normal Forms of an Integer Matrix

1989 ◽  
Vol 18 (4) ◽  
pp. 658-669 ◽  
Author(s):  
Costas S. Iliopoulos
Keyword(s):  
Normal Forms ◽  
Abelian Groups ◽  
Canonical Structure ◽  
Finite Abelian Groups ◽  
Integer Matrix ◽  
Worst Case ◽  
Complexity Bounds ◽  
Case Complexity ◽  
Worst Case Complexity ◽  
Smith Normal Forms

scholarly journals Soft clustering by convex electoral model

2020 ◽  
Vol 24 (23) ◽  
pp. 17609-17620 ◽  
Author(s):  
Yurii Nesterov
Keyword(s):  
Time Complexity ◽  
Unique Fixed Point ◽  
Multidimensional Data ◽  
Worst Case ◽  
Complexity Bounds ◽  
Soft Clustering ◽  
Case Complexity ◽  
Worst Case Complexity ◽  
Direct Minimization ◽  
A New Technique

AbstractIn this paper, we suggest a new technique for soft clustering of multidimensional data. It is based on a new convex voting model, where each voter chooses a party with certain probability depending on the divergence between his/her preferences and the position of the party. The parties can react on the results of polls by changing their positions. We prove that under some natural assumptions this system has a unique fixed point, providing a unique solution for soft clustering. The solution of our model can be found either by imitation of the sequential elections, or by direct minimization of a convex potential function. In both cases, the methods converge linearly to the solution. We provide our methods with worst-case complexity bounds. To the best of our knowledge, these are the first polynomial-time complexity results in this field.

scholarly journals Average case complexity under the universal distribution equals worst-case complexity

1992 ◽  
Vol 42 (3) ◽  
pp. 145-149 ◽  
Author(s):  
Ming Li ◽  
Paul M.B. Vitányi
Keyword(s):  
Worst Case ◽  
Average Case ◽  
Case Complexity ◽  
Universal Distribution ◽  
Average Case Complexity ◽  
Worst Case Complexity

scholarly journals On the optimal order of worst case complexity of direct search

2015 ◽  
Vol 10 (4) ◽  
pp. 699-708 ◽  
Author(s):  
M. Dodangeh ◽  
L. N. Vicente ◽  
Z. Zhang
Keyword(s):  
Direct Search ◽  
Optimal Order ◽  
Worst Case ◽  
Case Complexity ◽  
Worst Case Complexity

scholarly journals A generalized worst-case complexity analysis for non-monotone line searches

2020 ◽  
Author(s):  
Geovani N. Grapiglia ◽  
Ekkehard W. Sachs
Keyword(s):  
Complexity Analysis ◽  
Worst Case ◽  
Case Complexity ◽  
Line Searches ◽  
Worst Case Complexity

Worst-case Complexity of Exact Algorithms forNP-hard Problems

2010 ◽  
pp. 203-240
Author(s):  
Federico Della Croce ◽  
Bruno Escoffier ◽  
Marcin Kamiski ◽  
Vangelis Th. Paschos
Keyword(s):  
Exact Algorithms ◽  
Worst Case ◽  
Case Complexity ◽  
Worst Case Complexity ◽  
Hard Problems
Sign in / Sign up

Export Citation Format

Share Document