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...
share
research
∙
05/30/2023
On the Approximability of External-Influence-Driven Problems
Domination problems in general can capture situations in which some enti...
research
∙
01/11/2022
Approximating Subset Sum Ratio via Subset Sum Computations
We present a new FPTAS for the Subset Sum Ratio problem, which, given a ...
research
∙
12/08/2021
Faster Algorithms for k-Subset Sum and Variations
We present new, faster pseudopolynomial time algorithms for the k-Subset...
research
∙
03/14/2020
Approximation Schemes for Subset Sum Ratio Problems
We consider the Subset Sum Ratio Problem (SSR), in which given a set of ...
research
∙
03/05/2020
Characterizations and approximability of hard counting classes below #P
An important objective of research in counting complexity is to understa...
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 ...
research
∙
02/14/2019
Parameterized Fine-Grained Reductions
During recent years the field of fine-grained complexity has bloomed to ...
research
∙
03/27/2018
A Faster FPTAS for the Subset-Sums Ratio Problem
The Subset-Sums Ratio problem (SSR) is an optimization problem in which,...
research
∙
11/06/2017