12 citations · 64 across the 32 of their papers we have counts for
Showing 2011 · math.GRShow all
2 papers · 2 filters
math.GR2011
The Krohn-Rhodes Theorem and Local Divisors
Volker Diekert, Manfred Kufleitner, Benjamin Steinberg
We give a new proof of the Krohn-Rhodes Theorem using local divisors. The proof provides nearly as good a decomposition in terms of size as the holonomy decomposition of Eilenberg,…
math.GR2011
Efficient algorithms for highly compressed data: The Word Problem in Higman's group is in P
Volker Diekert, Jürn Laun, Alexander Ushakov
Power circuits are data structures which support efficient algorithms for highly compressed integers. Using this new data structure it has been shown recently by Myasnikov, Ushakov…