AI Chat AI Image Generator AI Video Text to Speech

On the complexity of counting feedback arc sets

09/07/2019

∙

by Kévin Perrot, et al.

∙

∙

In this note we study the computational complexity of feedback arc set counting problems in directed graphs, highlighting some subtle yet common properties of counting classes. Counting the number of feedback arc sets of cardinality k and the total number of feedback arc sets are #P-complete problems, while counting the number of minimum feedback arc sets is only proven to be #P-hard. Indeed, this latter problem is #.OptP[log n]-complete, hence if it belongs to #P then P=NP.

page 1

page 2

page 3

page 4

research

∙ 08/29/2018

Counting Independent Sets in Cocomparability Graphs

We show that the number of independent sets in cocomparability graphs ca...

0 Martin Dyer, et al. ∙

research

∙ 10/19/2020

On the Robustness of Winners: Counting Briberies in Elections

We study the parameterized complexity of counting variants of Swap- and ...

0 Niclas Boehmer, et al. ∙

research

∙ 06/20/2023

On the power of counting the total number of computation paths of NPTMs

Complexity classes defined by modifying the acceptance condition of NP c...

0 Eleni Bakali, et al. ∙

research

∙ 08/20/2023

Computational complexity of counting coincidences

Can you decide if there is a coincidence in the numbers counting two dif...

0 Swee Hong Chan, et al. ∙

research

∙ 04/27/2019

Parameterised Counting Classes with Bounded Nondeterminism

Stockhusen and Tantau (IPEC 2013) introduced the operators paraW and par...

0 Anselm Haak, et al. ∙

research

∙ 12/28/2019

Approximate #Knapsack Computations to Count Semi-Fair Allocations

In this paper, we study the problem of counting the number of different ...

0 Theofilos Triommatis, et al. ∙

research

∙ 09/29/2021

Gaps, Ambiguity, and Establishing Complexity-Class Containments via Iterative Constant-Setting

Cai and Hemachandra used iterative constant-setting to prove that Few ⊆ ...

0 Lane A. Hemaspaandra, et al. ∙