6 citations · 6 across the 2 of their papers we have counts for
2 papers
cs.CC2016
Circuit Evaluation for Finite Semirings
Moses Ganardi, Danny Hucke, Daniel König +1
The computational complexity of the circuit evaluation problem for finite semirings is considered, where semirings are not assumed to have an additive or multiplicative identity. T…
math.GR2015★ 6 cited
Knapsack and subset sum problems in nilpotent, polycyclic, and co-context-free groups
Daniel König, Markus Lohrey, Georg Zetzsche
It is shown that the knapsack problem (introduced by Myasnikov, Nikolaev, and Ushakov) is undecidable in a direct product of sufficiently many copies of the discrete Heisenberg gro…