Zobrazeno 1 - 8
of 8
pro vyhledávání: '"Bakali, Eleni"'
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 these variants, we modify the acceptance criteria so that they concern t
Externí odkaz:
http://arxiv.org/abs/2306.11614
An important objective of research in counting complexity is to understand which counting problems are approximable. In this quest, the complexity class TotP, a hard subclass of #P, is of key importance, as it contains self-reducible counting problem
Externí odkaz:
http://arxiv.org/abs/2003.02524
We present a new framework for creating elegant algorithms for exact uniform sampling of important Catalan structures, such as triangulations of convex polygons, Dyck words, monotonic lattice paths and mountain ranges. Along with sampling, we obtain
Externí odkaz:
http://arxiv.org/abs/1803.03945
Autor:
Bakali, Eleni
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
Externí odkaz:
http://arxiv.org/abs/1801.01901
Autor:
Bakali, Eleni
A standard method for designing randomized algorithms to approximately count the number of solutions of a problem in $\#$P, is by constructing a rapidly mixing Markov chain converging to the uniform distribution over this set of solutions. This const
Externí odkaz:
http://arxiv.org/abs/1711.08852
Autor:
Bakali, Eleni
We consider the class of counting problems,i.e. functions in $\#$P, which are self reducible, and have easy decision version, i.e. for every input it is easy to decide if the value of the function $f(x)$ is zero. For example, $\#$independent-sets of
Externí odkaz:
http://arxiv.org/abs/1611.01706
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.