Alternation Complexity is a computational complexity measure that characterizes the minimum number of alternating quantifier levels required in a logical formula to express a decision problem, distinguishing it from other complexity measures by its focus on quantifier alternation in descriptive complexity theory.
5
Publications
139
Citations
7
Authors
6
Institutions
Publications per year
2017–2026
0
Parents
Publications
5
1–5 of 5
Authors
7
- CK
2
h-index
- RG
1
h-index
- MF
1
h-index
- RR
1
h-index
- YS
1
h-index
1–5 of 7
Institutions
6
TU Wien
Vienna, Austria
1 h-index
1 publications
23 citations
Saarland University
Saarbrücken, Germany
1 h-index
1 publications
37 citations
University of Bonn
Bonn, Germany
1 h-index
3 publications
66 citations
Université Paris-Sud
Orsay, France
1 h-index
1 publications
21 citations
University of Edinburgh
Edinburgh, United Kingdom
1 h-index
1 publications
36 citations
Université Paris Cité
Paris, France
1 h-index
1 publications
21 citations
University of Warsaw
Warsaw, Poland
1 publications
10 citations
Universität Trier
Trier, Germany
1 publications
10 citations
1–8 of 6
Venues
- Computational Complexity
CC · 1 publications · 22 citations
1
h-index
- Theoretical Computer Science
1 publications · 36 citations
1
h-index
- ACM Transactions on Database Systems
TODS · 1 publications · 37 citations
1
h-index
- DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)
Repository · 1 publications · 21 citations
1
h-index
- RAIRO - Theoretical Informatics and Applications
ITA · 1 publications · 10 citations
1–5