Back to Search
Start Over
Knapsack in Graph Groups.
- Source :
-
Theory of Computing Systems . Jan2018, Vol. 62 Issue 1, p192-246. 55p. - Publication Year :
- 2018
-
Abstract
- It is shown that the knapsack problem, which was introduced by Myasnikov et al. for arbitrary finitely generated groups, can be solved in NP for every graph group. This result even holds if the group elements are represented in a compressed form by so called straight-line programs, which generalizes the classical NP-completeness result of the integer knapsack problem. If group elements are represented explicitly by words over the generators, then knapsack for a graph group belongs to the class LogCFL (a subclass of P) if the graph group can be built up from the trivial group using the operations of free product and direct product with $\mathbb {Z}$ . In all other cases, the knapsack problem is NP-complete. [ABSTRACT FROM AUTHOR]
Details
- Language :
- English
- ISSN :
- 14324350
- Volume :
- 62
- Issue :
- 1
- Database :
- Academic Search Index
- Journal :
- Theory of Computing Systems
- Publication Type :
- Academic Journal
- Accession number :
- 127145128
- Full Text :
- https://doi.org/10.1007/s00224-017-9808-3