
On the complexity of counting feedback arc sets
In this note we study the computational complexity of feedback arc set c...
read it

Complexity classification of counting graph homomorphisms modulo a prime number
Counting graph homomorphisms and its generalizations such as the Countin...
read it

The Complexity of Approximately Counting Retractions
Let G be a graph that contains an induced subgraph H. A retraction from ...
read it

Validation of counting methods in bibliometrics
The discussion about counting methods in bibliometrics is often reduced ...
read it

Counting Polynomial Roots in Isabelle/HOL: A Formal Proof of the BudanFourier Theorem
Many problems in computer algebra and numerical analysis can be reduced ...
read it

Counting methods introduced into the bibliometric research literature 19702018: A review
The present review of bibliometric counting methods investigates 1) the ...
read it

Parameterized Valiant's Classes
We define a theory of parameterized algebraic complexity classes in anal...
read it
On the Robustness of Winners: Counting Briberies in Elections
We study the parameterized complexity of counting variants of Swap and ShiftBribery problems, focusing on the parameterizations by the number of swaps and the number of voters. We show experimentally that SwapBribery offers a new approach to the robustness analysis of elections.
READ FULL TEXT
Comments
There are no comments yet.