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
Parents
3
An <i>n</i> ! lower bound on formula size
Micah Adler, Neil Immerman · ACM Transactions on Computational Logic · 2003 · 53 citations
1–3 of 3
5
1
h-index
1
h-index
1
h-index
1
h-index
1
h-index
1–5 of 5
TOCL · 1 publications · 53 citations
1
h-index
1 publications · 14 citations
1
h-index
1 publications · 149 citations
1
h-index
1–3