Highly Influenced

In this paper we address some algorithmic problems related to computations in finitedimensional associative algebras over finite fields. Our starting point is the structure theory of finite-dimensional assoeiative algebras. This theory determines, mostly in a nonconstructive way, the building blocks of these algebras. Our aim is to give polynomial time… (More)

Citations per Year

Averaging **4 citations** per year over the last 3 years.

### Presentations referencing similar topics