Aggeliki Chalki

According to our database, Aggeliki Chalki authored at least 10 papers between 2017 and 2023.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of four.

2023

On the power of counting the total number of computation paths of NPTMs.

Eleni Bakali, Aggeliki Chalki, Sotiris Kanellopoulos, Aris Pagourtzis, Stathis Zachos

CoRR, 2023

Counting Computations with Formulae: Logical Characterisations of Counting Complexity Classes.

Antonis Achilleos, Aggeliki Chalki

Proceedings of the 48th International Symposium on Mathematical Foundations of Computer Science, 2023

2022

On structural and descriptive complexity of hard counting problems the decision version of which is easy

Aggeliki Chalki

PhD thesis, 2022

Completeness, approximability and exponential time results for counting problems with easy decision version.

Antonis Antonopoulos, Eleni Bakali, Aggeliki Chalki, Aris Pagourtzis, Petros Pantavos, Stathis Zachos

Theor. Comput. Sci., 2022

Guest column: A panorama of counting problems the decision version of which is in P³.

Eleni Bakali, Aggeliki Chalki, Andreas Göbel, Aris Pagourtzis, Stathis Zachos

SIGACT News, 2022

2021

A note on the complexity of S4.2.

Aggeliki Chalki, Costas D. Koutras, Yorgos Zikos

J. Appl. Non Class. Logics, 2021

2020

Characterizations and approximability of hard counting classes below #P.

Eleni Bakali, Aggeliki Chalki, Aris Pagourtzis

CoRR, 2020

Characterizations and Approximability of Hard Counting Classes Below \(\#\mathsf {P}\).

Eleni Bakali, Aggeliki Chalki, Aris Pagourtzis

Proceedings of the Theory and Applications of Models of Computation, 2020

2018

A quick guided tour to the modal logic S4.2.

Aggeliki Chalki, Costas D. Koutras, Yorgos Zikos

Log. J. IGPL, 2018

2017

Completeness Results for Counting Problems with Easy Decision.

Eleni Bakali, Aggeliki Chalki, Aris Pagourtzis, Petros Pantavos, Stathis Zachos

Proceedings of the Algorithms and Complexity - 10th International Conference, 2017