Aggeliki Chalki

16 papers B 2C 3Journal 9Unranked 1
YearRankTypeTitle / Venue / Authors
2025 — conf
The Complexity of Deciding Characteristic Formulae Modulo Nested Simulation (extended abstract).
GandALF
Luca Aceto, Antonis Achilleos, Aggeliki Chalki, Anna Ingólfsdóttir
2025 B conf
The Complexity of Deciding Characteristic Formulae in Van Glabbeek's Branching-Time Spectrum.
CSL
Luca Aceto, Antonis Achilleos, Aggeliki Chalki, Anna Ingólfsdóttir
2025 J jnl
The complexity of deciding characteristic formulae modulo nested simulation.
CoRR
Luca Aceto, Antonis Achilleos, Aggeliki Chalki, Anna Ingólfsdóttir
2024 C conf
On the Power of Counting the Total Number of Computation Paths of NPTMs.
TAMC
Eleni Bakali, Aggeliki Chalki, Sotiris Kanellopoulos, Aris Pagourtzis, Stathis Zachos
2024 J jnl
The complexity of deciding characteristic formulae in van Glabbeek's branching-time spectrum.
CoRR
Luca Aceto, Antonis Achilleos, Aggeliki Chalki, Anna Ingólfsdóttir
2023 B conf
Counting Computations with Formulae: Logical Characterisations of Counting Complexity Classes.
MFCS
Antonis Achilleos, Aggeliki Chalki
2023 J jnl
Counting Computations with Formulae: Logical Characterisations of Counting Complexity Classes.
CoRR
Antonis Achilleos, Aggeliki Chalki
2023 J jnl
On the power of counting the total number of computation paths of NPTMs.
CoRR
Eleni Bakali, Aggeliki Chalki, Sotiris Kanellopoulos, Aris Pagourtzis, Stathis Zachos
2022 J jnl
Completeness, approximability and exponential time results for counting problems with easy decision version.
Theor. Comput. Sci.
Antonis Antonopoulos, Eleni Bakali, Aggeliki Chalki, Aris Pagourtzis, Petros Pantavos, Stathis Zachos
2022 J jnl
Guest column: A panorama of counting problems the decision version of which is in P
SIGACT News
Eleni Bakali, Aggeliki Chalki, Andreas Göbel, Aris Pagourtzis, Stathis Zachos
2022 — —
On structural and descriptive complexity of hard counting problems the decision version of which is easy
Aggeliki Chalki
2021 J jnl
A note on the complexity of S4.2.
J. Appl. Non Class. Logics
Aggeliki Chalki, Costas D. Koutras, Yorgos Zikos
2020 C conf
Characterizations and Approximability of Hard Counting Classes Below \(\#\mathsf {P}\).
TAMC
Eleni Bakali, Aggeliki Chalki, Aris Pagourtzis
2020 J jnl
Characterizations and approximability of hard counting classes below #P.
CoRR
Eleni Bakali, Aggeliki Chalki, Aris Pagourtzis
2018 J jnl
A quick guided tour to the modal logic S4.2.
Log. J. IGPL
Aggeliki Chalki, Costas D. Koutras, Yorgos Zikos
2017 C conf
Completeness Results for Counting Problems with Easy Decision.
CIAC
Eleni Bakali, Aggeliki Chalki, Aris Pagourtzis, Petros Pantavos, Stathis Zachos