10 citations · 11 across the 10 of their papers we have counts for
Showing 2023Show all
2 papers · 1 filter
cs.CC2023
On the power of counting the total number of computation paths of NPTMs
Eleni Bakali, Aggeliki Chalki, Sotiris Kanellopoulos +2
In this paper, we define and study variants of several complexity classes of decision problems that are defined via some criteria on the number of accepting paths of an NPTM. In th…
cs.DS2023
On the Approximability of External-Influence-Driven Problems
Panagiotis Aivasiliotis, Aris Pagourtzis
Domination problems in general can capture situations in which some entities have an effect on other entities (and sometimes on themselves). The usual goal is to select a minimum n…