Concepedia

Fine-grained Complexity

Fine-Grained Complexity is a subfield of computational complexity theory that classifies computational problems based on their precise running time dependencies, distinguishing itself by aiming to establish tight conditional lower bounds under conjectured hardness assumptions of well-studied problems such as the Strong Exponential Time Hypothesis or the 3SUM conjecture.

45

Publications

1K

Citations

110

Authors

71

Institutions

Publications per year

2017–2026

26

Variants

Fine-grained Complexity Theory

Parents

Publications

45

Action and Crime: A Fine-Grained Approach

Alvin I. Goldman · University of Pennsylvania Law Review · 1994 · 72 citations

, , +9

A new complexity measure for time series analysis and classification

Nithin Nagaraj, Karthi Balasubramanian, Sutirth Dey · The European Physical Journal Special Topics · 2013 · 70 citations

, , +14

Revisiting the predictive power of traditional vs. fine-grained syntactic complexity indices for L2 writing quality: The case of two genres

Xiaopeng Zhang, Xiaofei Lu · Assessing Writing · 2021 · 64 citations

, , +14

Discovering Inner Complexity: Time Shifting and Transposition with a Real-Time Granulation Technique

Barry Truax · Computer Music Journal · 1994 · 61 citations

, , +12

Towards a Finer-Grained Theory of Italian Participial Clausal Architecture

Paola Benincà, Christina Tortora · Scholarly Commons (University of Pennsylvania) · 2009 · 38 citations · Full text

, , +2

1–5 of 45

Authors

110

  1. AA
    Amir Abboud

    Stanford University, United States

    4 publications · 78 citations

    4

    h-index

  2. KB
    Karl Bringmann

    Max Planck Institute for Informatics, Germany

    4 publications · 68 citations

    4

    h-index

  3. AB
    Artūrs Bačkurs

    Massachusetts Institute of Technology, United States

    3 publications · 59 citations

    3

    h-index

  4. SZ
    Shai Zeevi

    Technion – Israel Institute of Technology, Israel

    2 publications · 34 citations

    2

    h-index

  5. PM
    Pasin Manurangsi

    University of California, Berkeley, United States

    2 publications · 47 citations

    2

    h-index

1–5 of 110

Institutions

71

  1. Massachusetts Institute of Technology

    Cambridge, United States

    5 h-index

    9 publications

    152 citations

  2. Stanford University

    Stanford, United States

    4 h-index

    4 publications

    78 citations

  3. Centre National de la Recherche Scientifique

    Paris, France

    3 h-index

    3 publications

    63 citations

  4. Saarland University

    Saarbrücken, Germany

    3 h-index

    5 publications

    109 citations

  5. Max Planck Institute for Informatics

    Saarbrücken, Germany

    3 h-index

    4 publications

    71 citations

  6. The University of Texas at Austin

    Austin, United States

    2 h-index

    7 publications

    117 citations

  7. Technion – Israel Institute of Technology

    Haifa, Israel

    2 h-index

    5 publications

    88 citations

  8. University of California, Berkeley

    Berkeley, United States

    2 h-index

    3 publications

    82 citations

1–8 of 71

Venues

  1. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)

    Repository · 11 publications · 202 citations

    11

    h-index

  2. arXiv (Cornell University)

    Repository · 4 publications · 55 citations

    4

    h-index

  3. Assessing Writing

    2 publications · 78 citations

    2

    h-index

  4. ACM Transactions on Algorithms

    TALG · 2 publications · 31 citations

    2

    h-index

  5. Complexity

    1 publications · 16 citations

    1

    h-index

1–5