On subset sum problem in branch groups

DOI10.46298/JGCC.2020.12.1.6541zbMATH Open1544.68082MaRDI QIDQ6566684

Andrey Nikolaev, Alexander Ushakov

Publication date: 3 July 2024

Published in: Journal of Groups, Complexity, Cryptology (Search for Journal in Brave)

zbMATH Keywords

NP-completenessbranch groupsGrigorchuk groupsubset sum problem

Mathematics Subject Classification ID

Geometric group theory (20F65) Combinatorial optimization (90C27) Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Groups acting on trees (20E08)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Non-commutative lattice problems
• The Post correspondence problem in groups.
• Knapsack problem for nilpotent groups
• Knapsack problems in products of groups
• The uniqueness of the actions of certain branch groups on rooted trees.
• Knapsack Problems for Wreath Products
• Knapsack in graph groups, HNN-extensions and amalgamated products
• Knapsack problems in groups

This page was built for publication: On subset sum problem in branch groups

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6566684)