Pages that link to "Item:Q5111237"

The following pages link to TC^0 circuits for algorithmic problems in nilpotent groups (Q5111237):

Displaying 10 items.

• Evaluation of circuits over nilpotent and polycyclic groups (Q1750355) (← links)
• The conjugacy problem in free solvable groups and wreath products of abelian groups is in \(\mathsf{TC}^0\) (Q2311889) (← links)
• Two general schemes of algebraic cryptography (Q2317165) (← links)
• Low-complexity computations for nilpotent subgroup problems (Q4968234) (← links)
• Parallel complexity for nilpotent groups (Q5084295) (← links)
• (Q5092405) (← links)
• TC^0 circuits for algorithmic problems in nilpotent groups (Q5111237) (← links)
• Undecidability of the submonoid membership problem for free nilpotent group of class $l\geqslant 2$ of sufficiently large rank (Q6085106) (← links)
• The membership problem for subsemigroups of \(\operatorname{GL}_2(\mathbb{Z})\) is \textbf{NP}-complete (Q6178465) (← links)
• The power word problem in graph products (Q6580077) (← links)