Immerman-vardi Theorem

The Immerman-Vardi Theorem is a foundational result in descriptive complexity theory stating that over ordered structures, the logic FO(LFP)—first-order logic augmented with the least fixed point operator—exactly captures the complexity class PTIME (polynomial time), thereby characterizing the set of polynomial-time computable queries.

3

Publications

216

Citations

5

Authors

2

Institutions

Publications per year

2017–2026

0

Variants

Immerman–vardi Theorem

Authors

5

  1. MA
    Micah Adler

    University of Massachusetts Amherst, United States

    1 publications · 53 citations

    1

    h-index

  2. RB
    Rachel Ben‐Eliyahu‐Zohary

    Ben-Gurion University of the Negev, Israel

    1 publications · 14 citations

    1

    h-index

  3. MC
    Marco Cadoli

    Sapienza University of Rome, Italy

    1 publications · 149 citations

    1

    h-index

  4. MS
    Marco Schaerf

    Sapienza University of Rome, Italy

    1 publications · 149 citations

    1

    h-index

  5. NI
    Neil Immerman

    University of Massachusetts Amherst, United States

    1 publications · 53 citations

    1

    h-index

1–5 of 5

Institutions

2

  1. Ben-Gurion University of the Negev

    Beersheba, Israel

    1 h-index

    1 publications

    14 citations

  2. University of Massachusetts Amherst

    Amherst Center, United States

    1 h-index

    2 publications

    106 citations

1–2 of 2

Venues

  1. ACM Transactions on Computational Logic

    TOCL · 1 publications · 53 citations

    1

    h-index

  2. Artificial Intelligence

    1 publications · 14 citations

    1

    h-index

  3. The Journal of Logic Programming

    1 publications · 149 citations

    1

    h-index

1–3