AI Chat AI Image Generator AI Video Text to Speech

On randomized counting versus randomised decision

01/05/2018

∙

by Eleni Bakali, et al.

∙

∙

We study the question of which counting problems admit f.p.r.a.s., under a structural complexity perspective. Since problems in #P with NP-complete decision version do not admit f.p.r.a.s. (unless NP = RP), we study subclasses of #P, having decision version either in P or in RP. We explore inclusions between these subclasses and we present all possible worlds with respect to NP v.s. RP and RP v.s. P.

page 1

page 2

page 3

page 4

research

∙ 03/05/2020

Characterizations and approximability of hard counting classes below #P

An important objective of research in counting complexity is to understa...

0 Eleni Bakali, et al. ∙

research

∙ 06/09/2019

The Packed Interval Covering Problem is NP-complete

We introduce a new decision problem, called Packed Interval Covering (PI...

0 Abdallah Saffidine, et al. ∙

research

∙ 09/16/2023

Solving Satisfiability Modulo Counting for Symbolic and Statistical AI Integration With Provable Guarantees

Satisfiability Modulo Counting (SMC) encompasses problems that require b...

0 Jinzhao Li, 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

∙ 12/04/2020

Complexity of fixed point counting problems in Boolean Networks

A Boolean network (BN) with n components is a discrete dynamical system ...

0 Florian Bridoux, et al. ∙

research

∙ 11/24/2017

Relating counting complexity to non-uniform probability measures

A standard method for designing randomized algorithms to approximately c...

0 Eleni Bakali, et al. ∙

research

∙ 01/23/2023

The Identity Problem in the special affine group of ℤ^2

We consider semigroup algorithmic problems in the Special Affine group 𝖲...

0 Ruiwen Dong, et al. ∙