Author of the publication

Completeness Results for Counting Problems with Easy Decision.

, , , , and . CIAC, volume 10236 of Lecture Notes in Computer Science, page 55-66. (2017)

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

Acceptor-Definable Counting Classes., , , and . Panhellenic Conference on Informatics, volume 2563 of Lecture Notes in Computer Science, page 453-463. Springer, (2001)A New Characterization of BPP.. FSTTCS, volume 181 of Lecture Notes in Computer Science, page 179-187. Springer, (1984)Satisfying a maximum number of pre-routed requests in all-optical rings., , and . Comput. Networks, 42 (1): 55-63 (2003)Guest column: A panorama of counting problems the decision version of which is in P3., , , , and . SIGACT News, 53 (3): 46-68 (2022)Teaching Programming through Problem Solving: The Role of the Programming Language., and . FedCSIS, page 1533-1536. (2013)Ordered Coloring Grids and Related Graphs., , , , and . SIROCCO, volume 5869 of Lecture Notes in Computer Science, page 30-43. Springer, (2009)Two remarks on the power of counting., and . Theoretical Computer Science, volume 145 of Lecture Notes in Computer Science, page 269-276. Springer, (1983)Probabalistic Quantifiers vs. Distrustful Adversaries., and . FSTTCS, volume 287 of Lecture Notes in Computer Science, page 443-455. Springer, (1987)Maximizing the Guarded Boundary of an Art Gallery Is APX-Complete., , and . CIAC, volume 2653 of Lecture Notes in Computer Science, page 24-35. Springer, (2003)The Complexity of Counting Functions with Easy Decision Version., and . MFCS, volume 4162 of Lecture Notes in Computer Science, page 741-752. Springer, (2006)