arXiv (Cornell University)· 2012· Preprint
Knapsack in Graph Groups, HNN-Extensions and Amalgamated Products
- 371citations
- 2012year
Short summary
The knapsack problem, previously defined for general finitely generated groups, is now solvable in NP for graph groups, even with compressed group element representations.
AI-generated from the title and abstract; the full text is not read.
TakeawaysIn the app
Key pointsIn the app
Ask the paperIn the app
The rest is in the Pofolia app
Takeaways, key points and questions to the paper; new summaries every day for your field. Free.
Sign in on the web to openField: Geometry and Topology
Geometry and TopologyMathematics