Zobrazeno 1 - 10
of 7 130
pro vyhledávání: '"membership problem"'
Autor:
Bishop, Alex, D'Angeli, Daniele, Matucci, Francesco, Nagnibeda, Tatiana, Perego, Davide, Rodaro, Emanuele
We are interested in the generalised word problem (aka subgroup membership problem) for stabiliser subgroups of groups acting on rooted $d$-regular trees. Stabilisers of infinite rays in the tree are not finitely generated in general, and so the prob
Externí odkaz:
http://arxiv.org/abs/2412.08433
We consider the polynomial Ideal Membership Problem (IMP) for ideals encoding combinatorial problems that are instances of CSPs over a finite language. In this paper, the input polynomial $f$ has degree at most $d=O(1)$ (we call this problem IMP$_d$)
Externí odkaz:
http://arxiv.org/abs/2410.22102
Autor:
Wang, Wenhao
The ideal membership problem asks whether an element in the ring belongs to the given ideal. In this paper, we propose a function that reflecting the complexity of the ideal membership problem in the ring of Laurent polynomials with integer coefficie
Externí odkaz:
http://arxiv.org/abs/2408.01518
Autor:
Nikitin, Ivan
For a triple of convex bodies $(A, B, B)$ we solve the so called effective membership problem, i.e. for generic $f_1, f_2\in\mathbb{C}^{B}$ we provide a method to compute $\mathbb{C}^A\cap I$, where $I=(f_1, f_2)$ is an ideal in the ring of Laurent p
Externí odkaz:
http://arxiv.org/abs/2408.10884
Autor:
Shafrir, Doron
We show that the rational subset membership problem in $G$ can be reduced to the submonoid membership problem in $G{\times}H$ where $H$ is virtually Abelian. We use this to show that there is no algorithm reducing submonoid membership to a finite ind
Externí odkaz:
http://arxiv.org/abs/2405.12921
Autor:
Ossorio-Castillo, J., Tornero, José M.
Publikováno v:
International Journal of Unconventional Computing 16 (2021) 327-341
Two quantum algorithms are presented, which tackle well--known problems in the context of numerical semigroups: the numerical semigroup membership problem (NSMP) and the Sylvester denumerant problem (SDP).
Externí odkaz:
http://arxiv.org/abs/2402.05524
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.
Autor:
Kompatscher, Michael
The subpower membership problem SMP(A) of a finite algebraic structure A asks whether a given partial function from A^k to A can be interpolated by a term operation of A, or not. While this problem can be EXPTIME-complete in general, Willard asked wh
Externí odkaz:
http://arxiv.org/abs/2309.16549
Autor:
Arvind, V., Datta, Samir, Khan, Asif, Sharma, Shivdutt, Vasudev, Yadu, Vasudevan, Shankar Ram
Let $G$ be a finite group given as input by its multiplication table. For a subset $S$ of $G$ and an element $g\in G$ the Cayley Group Membership Problem (denoted CGM) is to check if $g$ belongs to the subgroup generated by $S$. While this problem is
Externí odkaz:
http://arxiv.org/abs/2308.10073