( en | de | ru )

 

Disambiguation of "Chalki, Aggeliki"

Author of the publication

copydeleteadd this publication to your clipboard
Characterizations and approximability of hard counting classes below #P.

, , and . CoRR, (2020)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

No persons found for author name Chalki, Aggeliki
add a person with the name Chalki, Aggeliki
 

Other publications of authors with the same name

Characterizations and Approximability of Hard Counting Classes Below \(\#P\)., , and . TAMC, volume 12337 of Lecture Notes in Computer Science, page 251-262. Springer, (2020)Completeness, approximability and exponential time results for counting problems with easy decision version., , , , , and . Theor. Comput. Sci., (2022)A note on the complexity of S4.2., , and . J. Appl. Non Class. Logics, 31 (2): 108-129 (2021)On the Power of Counting the Total Number of Computation Paths of NPTMs., , , , and . TAMC, volume 14637 of Lecture Notes in Computer Science, page 209-220. Springer, (2024)Characterizations and approximability of hard counting classes below #P., , and . CoRR, (2020)Guest column: A panorama of counting problems the decision version of which is in P3., , , , and . SIGACT News, 53 (3): 46-68 (2022)Counting Computations with Formulae: Logical Characterisations of Counting Complexity Classes., and . MFCS, volume 272 of LIPIcs, page 7:1-7:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2023)Completeness Results for Counting Problems with Easy Decision., , , , and . CIAC, volume 10236 of Lecture Notes in Computer Science, page 55-66. (2017)On structural and descriptive complexity of hard counting problems the decision version of which is easy. National Technical University of Athens, Greece, (2022)National Archive of PhD Theses: oai:10442/52239.On the power of counting the total number of computation paths of NPTMs., , , , and . CoRR, (2023)