Author of the publication

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

, , , , , and . Theor. Comput. Sci., (2022)

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)Characterizations and Approximability of Hard Counting Classes Below \(\#P\)., , and . TAMC, volume 12337 of Lecture Notes in Computer Science, page 251-262. Springer, (2020)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)On randomized counting versus randomised decision.. CoRR, (2018)Completeness, approximability and exponential time results for counting problems with easy decision version., , , , , and . Theor. Comput. Sci., (2022)Ιδιότητες συναρτήσεων μέτρησης πλήθους λύσεων σε προβλήματα με εύκολη απόφαση ύπαρξης λύσης: πληρότητα, προσεγγισιμότητα, μαρκοβιανές αλυσίδες, αλλαγές φάσης. National Technical University of Athens, Greece, (2018)National Archive of PhD Theses: oai:10442/45002.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)