Sign in

Knapsack and the Power Word Problem in Solvable Baumslag-Solitar Groups.

Markus LohreyGeorg Zetzsche
Published in: MFCS (2020)
Keyphrases
  • word problems
  • special case
  • dynamic programming
  • power consumption
  • knapsack problem
  • optimal solution
  • np hard
  • np complete
  • packing problem
  • computational complexity