Concepedia

Best-case Complexity

Best-Case Complexity is the computational complexity measure that characterizes the minimum asymptotic time or space required by an algorithm to solve a problem under the most favorable input conditions of a given size.

42

Publications

2.9K

Citations

91

Authors

64

Institutions

Publications per year

2017–2026

6

Parents

Publications

42

The worst-case time complexity for generating all maximal cliques and computational experiments

Etsuji Tomita, Akira Tanaka, Haruhisa Takahashi · Theoretical Computer Science · 2006 · 761 citations

, , +12

A fast algorithm for computing longest common subsequences

James Hunt, Thomas G. Szymanski · Communications of the ACM · 1977 · 692 citations · Full text

, , +13

The complexity of combinatorial problems with succinct input representation

Klaus W. Wagner · Acta Informatica · 1986 · 293 citations

, , +14

Fast condensed nearest neighbor rule

Fabrizio Angiulli · 2005 · 147 citations

, , +13

Efficient LCA based keyword search in XML data

Yu Xu, Yannis Papakonstantinou · 2008 · 119 citations · Full text

, , +15

1–5 of 42

Authors

91

  1. RG
    Rachid Guerraoui

    École Polytechnique Fédérale de Lausanne, Switzerland

    3 publications · 75 citations

    3

    h-index

  2. YX
    Yu Xu

    Teradata (United States), United States

    3 publications · 147 citations

    3

    h-index

  3. YP
    Yannis Papakonstantinou

    University of California San Diego, United States

    3 publications · 147 citations

    3

    h-index

  4. MV
    Marko Vukolić

    IBM Research - Zurich, Switzerland

    3 publications · 75 citations

    3

    h-index

  5. MN
    Matthias Niewerth

    University of Bayreuth, Germany

    2 publications · 43 citations

    2

    h-index

1–5 of 91

Institutions

64

  1. Centre National de la Recherche Scientifique

    Paris, France

    3 h-index

    4 publications

    63 citations

  2. École Polytechnique Fédérale de Lausanne

    Lausanne, Switzerland

    3 h-index

    6 publications

    143 citations

  3. Teradata (United States)

    San Diego, United States

    3 h-index

    3 publications

    147 citations

  4. University of California San Diego

    San Diego, United States

    3 h-index

    3 publications

    147 citations

  5. Laboratoire Traitement et Communication de l’Information

    Palaiseau, France

    2 h-index

    2 publications

    43 citations

  6. Télécom Paris

    Palaiseau, France

    2 h-index

    2 publications

    43 citations

  7. University of Chicago

    Chicago, United States

    2 h-index

    2 publications

    90 citations

  8. Université Savoie Mont Blanc

    Chambéry, France

    2 h-index

    2 publications

    30 citations

1–8 of 64

Venues

  1. SIAM Journal on Computing

    3 publications · 97 citations

    3

    h-index

  2. arXiv (Cornell University)

    Repository · 2 publications · 28 citations

    2

    h-index

  3. Journal of Complexity

    1 publications · 17 citations

    1

    h-index

  4. ACM Transactions on Computational Logic

    TOCL · 1 publications · 15 citations

    1

    h-index

  5. 1

    h-index

1–5