14 citations · 74 across the 41 of their papers we have counts for
4 papers · 1 filter
A universal tree balancing theorem
Moses Ganardi, Markus Lohrey
We present a general framework for balancing expressions (terms) in form of so called tree straight-line programs. The latter can be seen as circuits over the free term algebra ext…
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…
Parallel Identity Testing for Skew Circuits with Big Powers and Applications
Daniel König, Markus Lohrey
Powerful skew arithmetic circuits are introduced. These are skew arithmetic circuits with variables, where input gates can be labelled with powers for binary encoded numbers…
Evaluating Matrix Circuits
Daniel König, Markus Lohrey
The circuit evaluation problem (also known as the compressed word problem) for finitely generated linear groups is studied. The best upper bound for this problem is …