Author of the publication

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.

 

Other publications of authors with the same name

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)Stathis Zachos at 70!, , , , , , , , , and 1 other author(s). CIAC, volume 10236 of Lecture Notes in Computer Science, page 469-484. (2017)Completeness Results for Counting Problems with Easy Decision., , , , and . CIAC, volume 10236 of Lecture Notes in Computer Science, page 55-66. (2017)Self-reducible with easy decision version counting problems admit additive error approximation. Connections to counting complexity, exponential time complexity, and circuit lower bounds.. CoRR, (2016)On randomized counting versus randomised decision.. CoRR, (2018)On the power of counting the total number of computation paths of NPTMs., , , , and . CoRR, (2023)Optimizing Mobile Crowdsensing Platforms for Boundedly Rational Users., and . IEEE Trans. Mob. Comput., 21 (4): 1305-1318 (2022)Relating counting complexity to non-uniform probability measures.. CoRR, (2017)Characterizations and Approximability of Hard Counting Classes Below \(\#P\)., , and . TAMC, volume 12337 of Lecture Notes in Computer Science, page 251-262. Springer, (2020)